./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.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 d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:56:19,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:56:19,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 17:56:19,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:56:19,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:56:19,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:56:19,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:56:19,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:56:19,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:56:19,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:56:19,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:56:19,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:56:19,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:56:19,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:56:19,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:56:19,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:56:19,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 17:56:19,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:56:19,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:56:19,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:56:19,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:56:19,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 17:56:19,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:56:19,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 17:56:19,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:56:19,389 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 17:56:19,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:56:19,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:56:19,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 17:56:19,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:56:19,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:56:19,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:56:19,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:56:19,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:56:19,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:56:19,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:56:19,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:56:19,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 17:56:19,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:56:19,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:56:19,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:56:19,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:56:19,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:56:19,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:56:19,393 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2024-11-20 17:56:19,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:56:19,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:56:19,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:56:19,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:56:19,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:56:19,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2024-11-20 17:56:20,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:56:20,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:56:20,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2024-11-20 17:56:20,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbf40574/a39191fd6398442bbcd3d7c396a37cd9/FLAG255408223 [2024-11-20 17:56:20,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbf40574/a39191fd6398442bbcd3d7c396a37cd9 [2024-11-20 17:56:20,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:56:20,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:56:20,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:56:20,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:56:20,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:56:20,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:20" (1/1) ... [2024-11-20 17:56:20,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728dceca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:20, skipping insertion in model container [2024-11-20 17:56:20,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:20" (1/1) ... [2024-11-20 17:56:20,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:56:21,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:56:21,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:56:21,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:56:21,199 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:56:21,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21 WrapperNode [2024-11-20 17:56:21,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:56:21,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:56:21,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:56:21,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:56:21,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,236 INFO L138 Inliner]: procedures = 15, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2024-11-20 17:56:21,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:56:21,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:56:21,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:56:21,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:56:21,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,273 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 8, 34]. 77 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 20 writes are split as follows [0, 0, 20]. [2024-11-20 17:56:21,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:56:21,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:56:21,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:56:21,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:56:21,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (1/1) ... [2024-11-20 17:56:21,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:56:21,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:21,324 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-20 17:56:21,329 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-20 17:56:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 17:56:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:56:21,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:56:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:56:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:56:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 17:56:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:56:21,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:56:21,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:56:21,870 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-20 17:56:21,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:56:21,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:56:21,896 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 17:56:21,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:21 BoogieIcfgContainer [2024-11-20 17:56:21,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:56:21,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:56:21,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:56:21,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:56:21,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:56:20" (1/3) ... [2024-11-20 17:56:21,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d3a170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:21, skipping insertion in model container [2024-11-20 17:56:21,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:21" (2/3) ... [2024-11-20 17:56:21,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d3a170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:21, skipping insertion in model container [2024-11-20 17:56:21,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:21" (3/3) ... [2024-11-20 17:56:21,905 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2024-11-20 17:56:21,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:56:21,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2024-11-20 17:56:21,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:56:21,975 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;@397e19a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:56:21,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2024-11-20 17:56:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 180 states have (on average 1.9166666666666667) internal successors, (345), 326 states have internal predecessors, (345), 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-20 17:56:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 17:56:21,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:21,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:56:21,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:21,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1804997193, now seen corresponding path program 1 times [2024-11-20 17:56:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:21,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803880967] [2024-11-20 17:56:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:56:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803880967] [2024-11-20 17:56:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803880967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:22,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:56:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555868134] [2024-11-20 17:56:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 17:56:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 17:56:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 17:56:22,140 INFO L87 Difference]: Start difference. First operand has 327 states, 180 states have (on average 1.9166666666666667) internal successors, (345), 326 states have internal predecessors, (345), 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-20 17:56:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:22,171 INFO L93 Difference]: Finished difference Result 648 states and 681 transitions. [2024-11-20 17:56:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 17:56:22,173 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-20 17:56:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:22,180 INFO L225 Difference]: With dead ends: 648 [2024-11-20 17:56:22,180 INFO L226 Difference]: Without dead ends: 320 [2024-11-20 17:56:22,183 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-20 17:56:22,185 INFO L432 NwaCegarLoop]: 337 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, 337 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-20 17:56:22,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:56:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-20 17:56:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-20 17:56:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 174 states have (on average 1.8908045977011494) internal successors, (329), 319 states have internal predecessors, (329), 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-20 17:56:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 329 transitions. [2024-11-20 17:56:22,224 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 329 transitions. Word has length 7 [2024-11-20 17:56:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:22,224 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 329 transitions. [2024-11-20 17:56:22,225 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-20 17:56:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 329 transitions. [2024-11-20 17:56:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 17:56:22,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:22,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:56:22,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:56:22,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:22,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1804999115, now seen corresponding path program 1 times [2024-11-20 17:56:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268754541] [2024-11-20 17:56:22,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:22,401 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-20 17:56:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:22,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268754541] [2024-11-20 17:56:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268754541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:22,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100109620] [2024-11-20 17:56:22,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:22,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:22,405 INFO L87 Difference]: Start difference. First operand 320 states and 329 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-20 17:56:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:22,463 INFO L93 Difference]: Finished difference Result 320 states and 329 transitions. [2024-11-20 17:56:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:22,464 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-20 17:56:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:22,465 INFO L225 Difference]: With dead ends: 320 [2024-11-20 17:56:22,465 INFO L226 Difference]: Without dead ends: 316 [2024-11-20 17:56:22,466 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-20 17:56:22,467 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:22,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 303 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:56:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-20 17:56:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-20 17:56:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 174 states have (on average 1.867816091954023) internal successors, (325), 315 states have internal predecessors, (325), 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-20 17:56:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 325 transitions. [2024-11-20 17:56:22,484 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 325 transitions. Word has length 7 [2024-11-20 17:56:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:22,484 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 325 transitions. [2024-11-20 17:56:22,485 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-20 17:56:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 325 transitions. [2024-11-20 17:56:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 17:56:22,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:22,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:56:22,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:56:22,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 120397771, now seen corresponding path program 1 times [2024-11-20 17:56:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112419719] [2024-11-20 17:56:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:22,649 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-20 17:56:22,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112419719] [2024-11-20 17:56:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112419719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:56:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479441605] [2024-11-20 17:56:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:22,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:56:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:56:22,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:56:22,651 INFO L87 Difference]: Start difference. First operand 316 states and 325 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-20 17:56:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:22,738 INFO L93 Difference]: Finished difference Result 316 states and 325 transitions. [2024-11-20 17:56:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:56:22,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-20 17:56:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:22,742 INFO L225 Difference]: With dead ends: 316 [2024-11-20 17:56:22,742 INFO L226 Difference]: Without dead ends: 312 [2024-11-20 17:56:22,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:56:22,743 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:22,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 302 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:56:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-20 17:56:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-20 17:56:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 174 states have (on average 1.8448275862068966) internal successors, (321), 311 states have internal predecessors, (321), 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-20 17:56:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 321 transitions. [2024-11-20 17:56:22,760 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 321 transitions. Word has length 8 [2024-11-20 17:56:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:22,760 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 321 transitions. [2024-11-20 17:56:22,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-20 17:56:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 321 transitions. [2024-11-20 17:56:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 17:56:22,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:22,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:56:22,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:56:22,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 472362386, now seen corresponding path program 1 times [2024-11-20 17:56:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290134202] [2024-11-20 17:56:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:22,789 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-20 17:56:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:22,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290134202] [2024-11-20 17:56:22,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290134202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:22,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:56:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961535905] [2024-11-20 17:56:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:22,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:56:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:56:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:56:22,790 INFO L87 Difference]: Start difference. First operand 312 states and 321 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-20 17:56:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:23,228 INFO L93 Difference]: Finished difference Result 588 states and 605 transitions. [2024-11-20 17:56:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:56:23,229 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-20 17:56:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:23,230 INFO L225 Difference]: With dead ends: 588 [2024-11-20 17:56:23,230 INFO L226 Difference]: Without dead ends: 460 [2024-11-20 17:56:23,231 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-20 17:56:23,232 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 144 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:23,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 219 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 17:56:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-20 17:56:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2024-11-20 17:56:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 455 states have internal predecessors, (473), 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-20 17:56:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 473 transitions. [2024-11-20 17:56:23,251 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 473 transitions. Word has length 11 [2024-11-20 17:56:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:23,253 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 473 transitions. [2024-11-20 17:56:23,253 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-20 17:56:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 473 transitions. [2024-11-20 17:56:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 17:56:23,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:23,254 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] [2024-11-20 17:56:23,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:56:23,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:23,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash 932440566, now seen corresponding path program 1 times [2024-11-20 17:56:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259746250] [2024-11-20 17:56:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:23,320 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-20 17:56:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259746250] [2024-11-20 17:56:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259746250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539746982] [2024-11-20 17:56:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:23,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:23,323 INFO L87 Difference]: Start difference. First operand 456 states and 473 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-20 17:56:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:23,535 INFO L93 Difference]: Finished difference Result 466 states and 484 transitions. [2024-11-20 17:56:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-20 17:56:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:23,537 INFO L225 Difference]: With dead ends: 466 [2024-11-20 17:56:23,538 INFO L226 Difference]: Without dead ends: 464 [2024-11-20 17:56:23,538 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-20 17:56:23,539 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:23,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 666 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-20 17:56:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2024-11-20 17:56:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 326 states have (on average 1.478527607361963) internal successors, (482), 463 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-20 17:56:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 482 transitions. [2024-11-20 17:56:23,551 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 482 transitions. Word has length 29 [2024-11-20 17:56:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:23,551 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 482 transitions. [2024-11-20 17:56:23,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-20 17:56:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 482 transitions. [2024-11-20 17:56:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 17:56:23,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:23,555 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] [2024-11-20 17:56:23,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:56:23,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:23,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1902184134, now seen corresponding path program 1 times [2024-11-20 17:56:23,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:23,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565839301] [2024-11-20 17:56:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:23,737 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-20 17:56:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565839301] [2024-11-20 17:56:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565839301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:56:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999110639] [2024-11-20 17:56:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:56:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:56:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:56:23,742 INFO L87 Difference]: Start difference. First operand 464 states and 482 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:56:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:24,125 INFO L93 Difference]: Finished difference Result 817 states and 849 transitions. [2024-11-20 17:56:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:56:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-20 17:56:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:24,129 INFO L225 Difference]: With dead ends: 817 [2024-11-20 17:56:24,129 INFO L226 Difference]: Without dead ends: 468 [2024-11-20 17:56:24,129 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-20 17:56:24,130 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 766 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:24,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 199 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 17:56:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-20 17:56:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2024-11-20 17:56:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 326 states have (on average 1.4662576687116564) internal successors, (478), 463 states have internal predecessors, (478), 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-20 17:56:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 478 transitions. [2024-11-20 17:56:24,141 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 478 transitions. Word has length 37 [2024-11-20 17:56:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:24,141 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 478 transitions. [2024-11-20 17:56:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:56:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 478 transitions. [2024-11-20 17:56:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 17:56:24,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:24,143 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] [2024-11-20 17:56:24,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:56:24,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 927755756, now seen corresponding path program 1 times [2024-11-20 17:56:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002489687] [2024-11-20 17:56:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:24,201 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-20 17:56:24,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002489687] [2024-11-20 17:56:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002489687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342834864] [2024-11-20 17:56:24,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:24,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:24,204 INFO L87 Difference]: Start difference. First operand 464 states and 478 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-20 17:56:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:24,541 INFO L93 Difference]: Finished difference Result 472 states and 486 transitions. [2024-11-20 17:56:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:24,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-11-20 17:56:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:24,546 INFO L225 Difference]: With dead ends: 472 [2024-11-20 17:56:24,546 INFO L226 Difference]: Without dead ends: 470 [2024-11-20 17:56:24,546 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-20 17:56:24,547 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 117 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:24,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 400 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:56:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-20 17:56:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 467. [2024-11-20 17:56:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 329 states have (on average 1.4620060790273557) internal successors, (481), 466 states have internal predecessors, (481), 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-20 17:56:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 481 transitions. [2024-11-20 17:56:24,553 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 481 transitions. Word has length 40 [2024-11-20 17:56:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:24,554 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 481 transitions. [2024-11-20 17:56:24,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-20 17:56:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 481 transitions. [2024-11-20 17:56:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 17:56:24,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:24,554 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] [2024-11-20 17:56:24,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:56:24,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:24,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1125761088, now seen corresponding path program 1 times [2024-11-20 17:56:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722486849] [2024-11-20 17:56:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:24,623 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-20 17:56:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722486849] [2024-11-20 17:56:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722486849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577187079] [2024-11-20 17:56:24,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:24,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:24,626 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-20 17:56:24,627 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-20 17:56:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:24,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:24,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:24,752 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-20 17:56:24,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:56:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577187079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:24,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:56:24,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-20 17:56:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165910508] [2024-11-20 17:56:24,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:24,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:56:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:56:24,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:56:24,754 INFO L87 Difference]: Start difference. First operand 467 states and 481 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-20 17:56:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:25,200 INFO L93 Difference]: Finished difference Result 470 states and 484 transitions. [2024-11-20 17:56:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:56:25,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-20 17:56:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:25,202 INFO L225 Difference]: With dead ends: 470 [2024-11-20 17:56:25,202 INFO L226 Difference]: Without dead ends: 453 [2024-11-20 17:56:25,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-20 17:56:25,202 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 149 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:25,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 369 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 17:56:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-20 17:56:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2024-11-20 17:56:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 329 states have (on average 1.4103343465045592) internal successors, (464), 449 states have internal predecessors, (464), 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-20 17:56:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 464 transitions. [2024-11-20 17:56:25,213 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 464 transitions. Word has length 46 [2024-11-20 17:56:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:25,214 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 464 transitions. [2024-11-20 17:56:25,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-20 17:56:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 464 transitions. [2024-11-20 17:56:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 17:56:25,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:25,214 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] [2024-11-20 17:56:25,223 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-20 17:56:25,415 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-20 17:56:25,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:25,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 538855426, now seen corresponding path program 1 times [2024-11-20 17:56:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:25,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760132787] [2024-11-20 17:56:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:25,500 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-20 17:56:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760132787] [2024-11-20 17:56:25,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760132787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679355315] [2024-11-20 17:56:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:25,503 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-20 17:56:25,504 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-20 17:56:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:25,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:25,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:25,620 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-20 17:56:25,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:56:25,673 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-20 17:56:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679355315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:56:25,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:56:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-20 17:56:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379295533] [2024-11-20 17:56:25,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:56:25,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:56:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:25,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:56:25,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:56:25,674 INFO L87 Difference]: Start difference. First operand 450 states and 464 transitions. Second operand has 10 states, 9 states have (on average 13.88888888888889) internal successors, (125), 10 states have internal predecessors, (125), 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-20 17:56:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:26,207 INFO L93 Difference]: Finished difference Result 503 states and 537 transitions. [2024-11-20 17:56:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:56:26,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.88888888888889) internal successors, (125), 10 states have internal predecessors, (125), 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 47 [2024-11-20 17:56:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:26,209 INFO L225 Difference]: With dead ends: 503 [2024-11-20 17:56:26,209 INFO L226 Difference]: Without dead ends: 444 [2024-11-20 17:56:26,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 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-20 17:56:26,210 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 391 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:26,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 362 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:56:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-20 17:56:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 438. [2024-11-20 17:56:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 373 states have (on average 1.2225201072386058) internal successors, (456), 437 states have internal predecessors, (456), 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-20 17:56:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 456 transitions. [2024-11-20 17:56:26,217 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 456 transitions. Word has length 47 [2024-11-20 17:56:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:26,217 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 456 transitions. [2024-11-20 17:56:26,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.88888888888889) internal successors, (125), 10 states have internal predecessors, (125), 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-20 17:56:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 456 transitions. [2024-11-20 17:56:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 17:56:26,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:26,218 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] [2024-11-20 17:56:26,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 17:56:26,418 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-20 17:56:26,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:26,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash -402367108, now seen corresponding path program 1 times [2024-11-20 17:56:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696271517] [2024-11-20 17:56:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:26,499 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-20 17:56:26,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:26,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696271517] [2024-11-20 17:56:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696271517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939583940] [2024-11-20 17:56:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:26,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:56:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:56:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:56:26,501 INFO L87 Difference]: Start difference. First operand 438 states and 456 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-20 17:56:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:26,515 INFO L93 Difference]: Finished difference Result 722 states and 750 transitions. [2024-11-20 17:56:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:56:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 79 [2024-11-20 17:56:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:26,517 INFO L225 Difference]: With dead ends: 722 [2024-11-20 17:56:26,517 INFO L226 Difference]: Without dead ends: 427 [2024-11-20 17:56:26,518 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-20 17:56:26,518 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 194 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:26,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:56:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-20 17:56:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-11-20 17:56:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 426 states have internal predecessors, (443), 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-20 17:56:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 443 transitions. [2024-11-20 17:56:26,528 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 443 transitions. Word has length 79 [2024-11-20 17:56:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:26,528 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 443 transitions. [2024-11-20 17:56:26,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-20 17:56:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 443 transitions. [2024-11-20 17:56:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 17:56:26,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:26,529 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] [2024-11-20 17:56:26,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:56:26,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -843450254, now seen corresponding path program 1 times [2024-11-20 17:56:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339093388] [2024-11-20 17:56:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:26,600 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-20 17:56:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339093388] [2024-11-20 17:56:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339093388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452466294] [2024-11-20 17:56:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:26,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:26,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:26,602 INFO L87 Difference]: Start difference. First operand 427 states and 443 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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-20 17:56:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:26,853 INFO L93 Difference]: Finished difference Result 437 states and 453 transitions. [2024-11-20 17:56:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:26,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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 79 [2024-11-20 17:56:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:26,855 INFO L225 Difference]: With dead ends: 437 [2024-11-20 17:56:26,855 INFO L226 Difference]: Without dead ends: 435 [2024-11-20 17:56:26,855 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-20 17:56:26,855 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 112 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:26,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 244 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-20 17:56:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2024-11-20 17:56:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 369 states have (on average 1.2113821138211383) internal successors, (447), 430 states have internal predecessors, (447), 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-20 17:56:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 447 transitions. [2024-11-20 17:56:26,861 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 447 transitions. Word has length 79 [2024-11-20 17:56:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:26,861 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 447 transitions. [2024-11-20 17:56:26,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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-20 17:56:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 447 transitions. [2024-11-20 17:56:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-20 17:56:26,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:26,862 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] [2024-11-20 17:56:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:56:26,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:26,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 41177286, now seen corresponding path program 1 times [2024-11-20 17:56:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109666280] [2024-11-20 17:56:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:26,936 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-20 17:56:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109666280] [2024-11-20 17:56:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109666280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163117091] [2024-11-20 17:56:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:26,938 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-20 17:56:26,939 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-20 17:56:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:26,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:26,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:27,043 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-20 17:56:27,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:56:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163117091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:27,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:56:27,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-20 17:56:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213950718] [2024-11-20 17:56:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:27,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:56:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:56:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:56:27,045 INFO L87 Difference]: Start difference. First operand 431 states and 447 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-20 17:56:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:27,345 INFO L93 Difference]: Finished difference Result 435 states and 451 transitions. [2024-11-20 17:56:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:56:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 85 [2024-11-20 17:56:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:27,346 INFO L225 Difference]: With dead ends: 435 [2024-11-20 17:56:27,346 INFO L226 Difference]: Without dead ends: 420 [2024-11-20 17:56:27,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 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-20 17:56:27,347 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:27,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 244 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:56:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-20 17:56:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 416. [2024-11-20 17:56:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 369 states have (on average 1.170731707317073) internal successors, (432), 415 states have internal predecessors, (432), 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-20 17:56:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 432 transitions. [2024-11-20 17:56:27,353 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 432 transitions. Word has length 85 [2024-11-20 17:56:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 432 transitions. [2024-11-20 17:56:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-20 17:56:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 432 transitions. [2024-11-20 17:56:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-20 17:56:27,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:27,354 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] [2024-11-20 17:56:27,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:56:27,554 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-20 17:56:27,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:27,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1276496024, now seen corresponding path program 1 times [2024-11-20 17:56:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109743051] [2024-11-20 17:56:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:27,628 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-20 17:56:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109743051] [2024-11-20 17:56:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109743051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954922065] [2024-11-20 17:56:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:27,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:27,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:27,631 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-20 17:56:27,631 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-20 17:56:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:27,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:27,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:27,735 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-20 17:56:27,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:56:27,788 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-20 17:56:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954922065] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:56:27,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:56:27,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-20 17:56:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968007667] [2024-11-20 17:56:27,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:56:27,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:56:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:56:27,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:56:27,789 INFO L87 Difference]: Start difference. First operand 416 states and 432 transitions. Second operand has 10 states, 9 states have (on average 18.0) internal successors, (162), 10 states have internal predecessors, (162), 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-20 17:56:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:28,165 INFO L93 Difference]: Finished difference Result 463 states and 482 transitions. [2024-11-20 17:56:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:56:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 18.0) internal successors, (162), 10 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-20 17:56:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:28,167 INFO L225 Difference]: With dead ends: 463 [2024-11-20 17:56:28,167 INFO L226 Difference]: Without dead ends: 461 [2024-11-20 17:56:28,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 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-20 17:56:28,167 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 261 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:28,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 190 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 17:56:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-20 17:56:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 457. [2024-11-20 17:56:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 410 states have (on average 1.1585365853658536) internal successors, (475), 456 states have internal predecessors, (475), 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-20 17:56:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 475 transitions. [2024-11-20 17:56:28,176 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 475 transitions. Word has length 86 [2024-11-20 17:56:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:28,176 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 475 transitions. [2024-11-20 17:56:28,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 18.0) internal successors, (162), 10 states have internal predecessors, (162), 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-20 17:56:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 475 transitions. [2024-11-20 17:56:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 17:56:28,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:28,177 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, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:56:28,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 17:56:28,380 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-20 17:56:28,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash 86946139, now seen corresponding path program 1 times [2024-11-20 17:56:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:28,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969293158] [2024-11-20 17:56:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 17:56:28,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:28,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969293158] [2024-11-20 17:56:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969293158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:28,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919083176] [2024-11-20 17:56:28,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:28,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:28,428 INFO L87 Difference]: Start difference. First operand 457 states and 475 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 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-20 17:56:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:28,619 INFO L93 Difference]: Finished difference Result 457 states and 475 transitions. [2024-11-20 17:56:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 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 111 [2024-11-20 17:56:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:28,621 INFO L225 Difference]: With dead ends: 457 [2024-11-20 17:56:28,621 INFO L226 Difference]: Without dead ends: 456 [2024-11-20 17:56:28,621 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-20 17:56:28,622 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:28,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 150 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-20 17:56:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-11-20 17:56:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 410 states have (on average 1.1560975609756097) internal successors, (474), 455 states have internal predecessors, (474), 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-20 17:56:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 474 transitions. [2024-11-20 17:56:28,628 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 474 transitions. Word has length 111 [2024-11-20 17:56:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:28,628 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 474 transitions. [2024-11-20 17:56:28,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 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-20 17:56:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 474 transitions. [2024-11-20 17:56:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 17:56:28,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:28,629 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:56:28,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 17:56:28,629 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:28,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1129167170, now seen corresponding path program 2 times [2024-11-20 17:56:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920097231] [2024-11-20 17:56:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-20 17:56:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920097231] [2024-11-20 17:56:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920097231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190012208] [2024-11-20 17:56:28,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:56:28,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:28,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:28,866 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-20 17:56:28,867 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-20 17:56:28,916 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:56:28,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:56:28,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:28,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-20 17:56:29,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:56:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-20 17:56:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190012208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:56:29,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:56:29,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 8 [2024-11-20 17:56:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262489092] [2024-11-20 17:56:29,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:56:29,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:56:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:56:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:56:29,329 INFO L87 Difference]: Start difference. First operand 456 states and 474 transitions. Second operand has 9 states, 8 states have (on average 15.875) internal successors, (127), 9 states have internal predecessors, (127), 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-20 17:56:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:29,521 INFO L93 Difference]: Finished difference Result 456 states and 474 transitions. [2024-11-20 17:56:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:56:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.875) internal successors, (127), 9 states have internal predecessors, (127), 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 117 [2024-11-20 17:56:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:29,524 INFO L225 Difference]: With dead ends: 456 [2024-11-20 17:56:29,524 INFO L226 Difference]: Without dead ends: 449 [2024-11-20 17:56:29,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:56:29,525 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 568 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:29,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 54 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-20 17:56:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 360. [2024-11-20 17:56:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 321 states have (on average 1.158878504672897) internal successors, (372), 359 states have internal predecessors, (372), 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-20 17:56:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 372 transitions. [2024-11-20 17:56:29,530 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 372 transitions. Word has length 117 [2024-11-20 17:56:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 372 transitions. [2024-11-20 17:56:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.875) internal successors, (127), 9 states have internal predecessors, (127), 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-20 17:56:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 372 transitions. [2024-11-20 17:56:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 17:56:29,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:29,532 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] [2024-11-20 17:56:29,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 17:56:29,732 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-20 17:56:29,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1629208082, now seen corresponding path program 1 times [2024-11-20 17:56:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154861667] [2024-11-20 17:56:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:29,808 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-20 17:56:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154861667] [2024-11-20 17:56:29,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154861667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:29,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827470235] [2024-11-20 17:56:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:29,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:56:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:29,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:56:29,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:56:29,810 INFO L87 Difference]: Start difference. First operand 360 states and 372 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-20 17:56:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:29,821 INFO L93 Difference]: Finished difference Result 546 states and 565 transitions. [2024-11-20 17:56:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:56:29,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 118 [2024-11-20 17:56:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:29,823 INFO L225 Difference]: With dead ends: 546 [2024-11-20 17:56:29,823 INFO L226 Difference]: Without dead ends: 350 [2024-11-20 17:56:29,823 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-20 17:56:29,823 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 127 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 203 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-20 17:56:29,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 203 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:56:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-20 17:56:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-20 17:56:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 313 states have (on average 1.1501597444089458) internal successors, (360), 349 states have internal predecessors, (360), 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-20 17:56:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 360 transitions. [2024-11-20 17:56:29,829 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 360 transitions. Word has length 118 [2024-11-20 17:56:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:29,829 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 360 transitions. [2024-11-20 17:56:29,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-20 17:56:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 360 transitions. [2024-11-20 17:56:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 17:56:29,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:29,830 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] [2024-11-20 17:56:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 17:56:29,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1188124936, now seen corresponding path program 1 times [2024-11-20 17:56:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251686953] [2024-11-20 17:56:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:29,894 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-20 17:56:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251686953] [2024-11-20 17:56:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251686953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:29,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479415350] [2024-11-20 17:56:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:29,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:29,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:29,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:29,896 INFO L87 Difference]: Start difference. First operand 350 states and 360 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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-20 17:56:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:30,144 INFO L93 Difference]: Finished difference Result 392 states and 403 transitions. [2024-11-20 17:56:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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 118 [2024-11-20 17:56:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:30,146 INFO L225 Difference]: With dead ends: 392 [2024-11-20 17:56:30,146 INFO L226 Difference]: Without dead ends: 390 [2024-11-20 17:56:30,146 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-20 17:56:30,146 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 107 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:30,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 189 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-20 17:56:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 354. [2024-11-20 17:56:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 317 states have (on average 1.1482649842271293) internal successors, (364), 353 states have internal predecessors, (364), 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-20 17:56:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 364 transitions. [2024-11-20 17:56:30,151 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 364 transitions. Word has length 118 [2024-11-20 17:56:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:30,152 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 364 transitions. [2024-11-20 17:56:30,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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-20 17:56:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 364 transitions. [2024-11-20 17:56:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 17:56:30,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:30,156 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] [2024-11-20 17:56:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 17:56:30,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 94628700, now seen corresponding path program 1 times [2024-11-20 17:56:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262152428] [2024-11-20 17:56:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:30,243 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-20 17:56:30,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262152428] [2024-11-20 17:56:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262152428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:30,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953607960] [2024-11-20 17:56:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:30,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:30,247 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-20 17:56:30,248 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-20 17:56:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:30,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:30,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:30,361 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-20 17:56:30,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:56:30,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953607960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:30,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:56:30,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-20 17:56:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397335681] [2024-11-20 17:56:30,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:30,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:56:30,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:56:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:56:30,363 INFO L87 Difference]: Start difference. First operand 354 states and 364 transitions. Second operand has 5 states, 4 states have (on average 30.0) internal successors, (120), 5 states have internal predecessors, (120), 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-20 17:56:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:30,643 INFO L93 Difference]: Finished difference Result 390 states and 401 transitions. [2024-11-20 17:56:30,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:56:30,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.0) internal successors, (120), 5 states have internal predecessors, (120), 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 124 [2024-11-20 17:56:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:30,644 INFO L225 Difference]: With dead ends: 390 [2024-11-20 17:56:30,644 INFO L226 Difference]: Without dead ends: 375 [2024-11-20 17:56:30,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 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-20 17:56:30,645 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 134 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:30,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 172 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:56:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-20 17:56:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 339. [2024-11-20 17:56:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 317 states have (on average 1.1009463722397477) internal successors, (349), 338 states have internal predecessors, (349), 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-20 17:56:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 349 transitions. [2024-11-20 17:56:30,650 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 349 transitions. Word has length 124 [2024-11-20 17:56:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 349 transitions. [2024-11-20 17:56:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.0) internal successors, (120), 5 states have internal predecessors, (120), 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-20 17:56:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 349 transitions. [2024-11-20 17:56:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-20 17:56:30,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:30,651 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, 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] [2024-11-20 17:56:30,657 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-20 17:56:30,858 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-20 17:56:30,860 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:30,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1407578609, now seen corresponding path program 1 times [2024-11-20 17:56:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:30,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973136620] [2024-11-20 17:56:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-20 17:56:30,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973136620] [2024-11-20 17:56:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973136620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:30,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:30,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222197973] [2024-11-20 17:56:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:30,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:30,919 INFO L87 Difference]: Start difference. First operand 339 states and 349 transitions. Second operand has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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-20 17:56:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:31,087 INFO L93 Difference]: Finished difference Result 344 states and 355 transitions. [2024-11-20 17:56:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:31,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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 150 [2024-11-20 17:56:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:31,088 INFO L225 Difference]: With dead ends: 344 [2024-11-20 17:56:31,088 INFO L226 Difference]: Without dead ends: 343 [2024-11-20 17:56:31,089 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-20 17:56:31,089 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 117 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:31,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 123 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-20 17:56:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 271. [2024-11-20 17:56:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 250 states have (on average 1.12) internal successors, (280), 270 states have internal predecessors, (280), 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-20 17:56:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 280 transitions. [2024-11-20 17:56:31,094 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 280 transitions. Word has length 150 [2024-11-20 17:56:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:31,095 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 280 transitions. [2024-11-20 17:56:31,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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-20 17:56:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 280 transitions. [2024-11-20 17:56:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 17:56:31,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:31,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 17:56:31,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 17:56:31,096 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:31,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2053871259, now seen corresponding path program 1 times [2024-11-20 17:56:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8922239] [2024-11-20 17:56:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:31,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:31,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8922239] [2024-11-20 17:56:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8922239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:31,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581760947] [2024-11-20 17:56:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:31,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:31,152 INFO L87 Difference]: Start difference. First operand 271 states and 280 transitions. Second operand has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 4 states have internal predecessors, (145), 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-20 17:56:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:31,332 INFO L93 Difference]: Finished difference Result 279 states and 289 transitions. [2024-11-20 17:56:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 4 states have internal predecessors, (145), 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 154 [2024-11-20 17:56:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:31,333 INFO L225 Difference]: With dead ends: 279 [2024-11-20 17:56:31,333 INFO L226 Difference]: Without dead ends: 278 [2024-11-20 17:56:31,334 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-20 17:56:31,335 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 117 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:31,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 120 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-20 17:56:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 238. [2024-11-20 17:56:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 218 states have (on average 1.1330275229357798) internal successors, (247), 237 states have internal predecessors, (247), 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-20 17:56:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2024-11-20 17:56:31,341 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 154 [2024-11-20 17:56:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2024-11-20 17:56:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 4 states have internal predecessors, (145), 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-20 17:56:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2024-11-20 17:56:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 17:56:31,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:31,342 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] [2024-11-20 17:56:31,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 17:56:31,342 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 442053006, now seen corresponding path program 1 times [2024-11-20 17:56:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497035666] [2024-11-20 17:56:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:31,429 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-20 17:56:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:31,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497035666] [2024-11-20 17:56:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497035666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547655964] [2024-11-20 17:56:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:56:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:56:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:56:31,431 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 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-20 17:56:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:31,438 INFO L93 Difference]: Finished difference Result 331 states and 344 transitions. [2024-11-20 17:56:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:56:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 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 157 [2024-11-20 17:56:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:31,439 INFO L225 Difference]: With dead ends: 331 [2024-11-20 17:56:31,439 INFO L226 Difference]: Without dead ends: 228 [2024-11-20 17:56:31,440 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-20 17:56:31,440 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:31,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:56:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-20 17:56:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-20 17:56:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 210 states have (on average 1.119047619047619) internal successors, (235), 227 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:56:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 235 transitions. [2024-11-20 17:56:31,444 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 235 transitions. Word has length 157 [2024-11-20 17:56:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:31,445 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 235 transitions. [2024-11-20 17:56:31,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 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-20 17:56:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 235 transitions. [2024-11-20 17:56:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 17:56:31,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:31,446 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] [2024-11-20 17:56:31,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 17:56:31,446 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 883136152, now seen corresponding path program 1 times [2024-11-20 17:56:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004370521] [2024-11-20 17:56:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:31,528 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-20 17:56:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:31,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004370521] [2024-11-20 17:56:31,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004370521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:31,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700461028] [2024-11-20 17:56:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:31,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:31,530 INFO L87 Difference]: Start difference. First operand 228 states and 235 transitions. Second operand has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 4 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-20 17:56:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:31,759 INFO L93 Difference]: Finished difference Result 328 states and 336 transitions. [2024-11-20 17:56:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 4 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 157 [2024-11-20 17:56:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:31,762 INFO L225 Difference]: With dead ends: 328 [2024-11-20 17:56:31,762 INFO L226 Difference]: Without dead ends: 326 [2024-11-20 17:56:31,763 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-20 17:56:31,763 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 102 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:31,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 145 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-20 17:56:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 232. [2024-11-20 17:56:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 214 states have (on average 1.1168224299065421) internal successors, (239), 231 states have internal predecessors, (239), 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-20 17:56:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 239 transitions. [2024-11-20 17:56:31,767 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 239 transitions. Word has length 157 [2024-11-20 17:56:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:31,767 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 239 transitions. [2024-11-20 17:56:31,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 4 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-20 17:56:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 239 transitions. [2024-11-20 17:56:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 17:56:31,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:31,768 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] [2024-11-20 17:56:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 17:56:31,769 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 231686316, now seen corresponding path program 1 times [2024-11-20 17:56:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873224143] [2024-11-20 17:56:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:31,860 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-20 17:56:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873224143] [2024-11-20 17:56:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873224143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958172446] [2024-11-20 17:56:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:31,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:31,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:31,863 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-20 17:56:31,864 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-20 17:56:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:31,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:31,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:31,986 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-20 17:56:31,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:56:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958172446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:31,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:56:31,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-20 17:56:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350927361] [2024-11-20 17:56:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:56:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:56:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:56:31,988 INFO L87 Difference]: Start difference. First operand 232 states and 239 transitions. Second operand has 5 states, 4 states have (on average 39.25) internal successors, (157), 5 states have internal predecessors, (157), 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-20 17:56:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:32,253 INFO L93 Difference]: Finished difference Result 326 states and 334 transitions. [2024-11-20 17:56:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:56:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 39.25) internal successors, (157), 5 states have internal predecessors, (157), 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 163 [2024-11-20 17:56:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:32,255 INFO L225 Difference]: With dead ends: 326 [2024-11-20 17:56:32,255 INFO L226 Difference]: Without dead ends: 311 [2024-11-20 17:56:32,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 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-20 17:56:32,255 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 129 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:32,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 127 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:56:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-20 17:56:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 217. [2024-11-20 17:56:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 214 states have (on average 1.0467289719626167) internal successors, (224), 216 states have internal predecessors, (224), 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-20 17:56:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 224 transitions. [2024-11-20 17:56:32,259 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 224 transitions. Word has length 163 [2024-11-20 17:56:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:32,260 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 224 transitions. [2024-11-20 17:56:32,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 39.25) internal successors, (157), 5 states have internal predecessors, (157), 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-20 17:56:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 224 transitions. [2024-11-20 17:56:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 17:56:32,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:32,261 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 17:56:32,267 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-20 17:56:32,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:32,462 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash -742039192, now seen corresponding path program 1 times [2024-11-20 17:56:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:32,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354320919] [2024-11-20 17:56:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:32,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354320919] [2024-11-20 17:56:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354320919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870616956] [2024-11-20 17:56:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:32,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:32,610 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-20 17:56:32,612 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-20 17:56:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:32,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:56:32,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:32,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:56:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870616956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:32,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:56:32,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-20 17:56:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001681422] [2024-11-20 17:56:32,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:56:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:32,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:56:32,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:56:32,722 INFO L87 Difference]: Start difference. First operand 217 states and 224 transitions. Second operand has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 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-20 17:56:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:32,916 INFO L93 Difference]: Finished difference Result 311 states and 319 transitions. [2024-11-20 17:56:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:56:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 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 177 [2024-11-20 17:56:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:32,917 INFO L225 Difference]: With dead ends: 311 [2024-11-20 17:56:32,917 INFO L226 Difference]: Without dead ends: 310 [2024-11-20 17:56:32,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 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-20 17:56:32,918 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 269 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:32,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 112 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:56:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-20 17:56:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 216. [2024-11-20 17:56:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 1.0420560747663552) internal successors, (223), 215 states have internal predecessors, (223), 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-20 17:56:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 223 transitions. [2024-11-20 17:56:32,921 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 223 transitions. Word has length 177 [2024-11-20 17:56:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:32,921 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 223 transitions. [2024-11-20 17:56:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 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-20 17:56:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 223 transitions. [2024-11-20 17:56:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 17:56:32,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:32,922 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 17:56:32,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 17:56:33,123 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,SelfDestructingSolverStorable23 [2024-11-20 17:56:33,123 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1528378025, now seen corresponding path program 1 times [2024-11-20 17:56:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:33,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040452758] [2024-11-20 17:56:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:33,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:33,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040452758] [2024-11-20 17:56:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040452758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:33,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754791206] [2024-11-20 17:56:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:33,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:33,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:33,225 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-20 17:56:33,226 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-20 17:56:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:33,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:56:33,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:33,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:56:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754791206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:56:33,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:56:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-20 17:56:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909613882] [2024-11-20 17:56:33,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:56:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 17:56:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 17:56:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-20 17:56:33,368 INFO L87 Difference]: Start difference. First operand 216 states and 223 transitions. Second operand has 12 states, 11 states have (on average 17.818181818181817) internal successors, (196), 12 states have internal predecessors, (196), 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-20 17:56:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:33,690 INFO L93 Difference]: Finished difference Result 335 states and 348 transitions. [2024-11-20 17:56:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:56:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 17.818181818181817) internal successors, (196), 12 states have internal predecessors, (196), 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 178 [2024-11-20 17:56:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:33,692 INFO L225 Difference]: With dead ends: 335 [2024-11-20 17:56:33,692 INFO L226 Difference]: Without dead ends: 334 [2024-11-20 17:56:33,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 349 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-20 17:56:33,693 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 245 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:33,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 214 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:56:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-20 17:56:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 240. [2024-11-20 17:56:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 238 states have (on average 1.050420168067227) internal successors, (250), 239 states have internal predecessors, (250), 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-20 17:56:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 250 transitions. [2024-11-20 17:56:33,697 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 250 transitions. Word has length 178 [2024-11-20 17:56:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:33,698 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 250 transitions. [2024-11-20 17:56:33,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 17.818181818181817) internal successors, (196), 12 states have internal predecessors, (196), 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-20 17:56:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 250 transitions. [2024-11-20 17:56:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 17:56:33,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:33,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 17:56:33,707 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-20 17:56:33,902 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,SelfDestructingSolverStorable24 [2024-11-20 17:56:33,902 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:33,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash -377730517, now seen corresponding path program 1 times [2024-11-20 17:56:33,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832215662] [2024-11-20 17:56:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:33,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 17:56:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832215662] [2024-11-20 17:56:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832215662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:56:33,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:56:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:56:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419473007] [2024-11-20 17:56:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:56:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:56:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:56:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:56:33,973 INFO L87 Difference]: Start difference. First operand 240 states and 250 transitions. Second operand has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 4 states have internal predecessors, (182), 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-20 17:56:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:34,112 INFO L93 Difference]: Finished difference Result 251 states and 262 transitions. [2024-11-20 17:56:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:56:34,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 4 states have internal predecessors, (182), 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 193 [2024-11-20 17:56:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:34,113 INFO L225 Difference]: With dead ends: 251 [2024-11-20 17:56:34,113 INFO L226 Difference]: Without dead ends: 250 [2024-11-20 17:56:34,113 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-20 17:56:34,114 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 112 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:34,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 104 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:56:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-20 17:56:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2024-11-20 17:56:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.0533980582524272) internal successors, (217), 206 states have internal predecessors, (217), 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-20 17:56:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 217 transitions. [2024-11-20 17:56:34,120 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 217 transitions. Word has length 193 [2024-11-20 17:56:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:34,120 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 217 transitions. [2024-11-20 17:56:34,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 4 states have internal predecessors, (182), 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-20 17:56:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2024-11-20 17:56:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-20 17:56:34,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:56:34,121 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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] [2024-11-20 17:56:34,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 17:56:34,121 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-11-20 17:56:34,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:56:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash 101559015, now seen corresponding path program 2 times [2024-11-20 17:56:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:56:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358425640] [2024-11-20 17:56:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:56:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:56:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:56:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:56:34,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:56:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358425640] [2024-11-20 17:56:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358425640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:56:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207496453] [2024-11-20 17:56:34,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:56:34,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:56:34,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:56:34,329 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-20 17:56:34,331 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-20 17:56:34,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:56:34,409 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:56:34,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:56:34,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:56:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-20 17:56:34,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:56:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-20 17:56:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207496453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:56:34,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:56:34,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-20 17:56:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365923197] [2024-11-20 17:56:34,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:56:34,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 17:56:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:56:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 17:56:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-20 17:56:34,770 INFO L87 Difference]: Start difference. First operand 207 states and 217 transitions. Second operand has 15 states, 14 states have (on average 25.928571428571427) internal successors, (363), 15 states have internal predecessors, (363), 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-20 17:56:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:56:35,185 INFO L93 Difference]: Finished difference Result 340 states and 353 transitions. [2024-11-20 17:56:35,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 17:56:35,185 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 25.928571428571427) internal successors, (363), 15 states have internal predecessors, (363), 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 202 [2024-11-20 17:56:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:56:35,186 INFO L225 Difference]: With dead ends: 340 [2024-11-20 17:56:35,186 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 17:56:35,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-20 17:56:35,187 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 413 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:56:35,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 126 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:56:35,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 17:56:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 17:56:35,187 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-20 17:56:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 17:56:35,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2024-11-20 17:56:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:56:35,187 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 17:56:35,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 25.928571428571427) internal successors, (363), 15 states have internal predecessors, (363), 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-20 17:56:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 17:56:35,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 17:56:35,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 146 remaining) [2024-11-20 17:56:35,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 146 remaining) [2024-11-20 17:56:35,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 146 remaining) [2024-11-20 17:56:35,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 146 remaining) [2024-11-20 17:56:35,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 146 remaining) [2024-11-20 17:56:35,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 146 remaining) [2024-11-20 17:56:35,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 146 remaining) [2024-11-20 17:56:35,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 146 remaining) [2024-11-20 17:56:35,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 146 remaining) [2024-11-20 17:56:35,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 146 remaining) [2024-11-20 17:56:35,205 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-20 17:56:35,399 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,SelfDestructingSolverStorable26 [2024-11-20 17:56:35,402 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] [2024-11-20 17:56:35,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 17:56:35,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:56:35,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:56:35 BoogieIcfgContainer [2024-11-20 17:56:35,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:56:35,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:56:35,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:56:35,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:56:35,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:21" (3/4) ... [2024-11-20 17:56:35,675 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 17:56:35,684 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-20 17:56:35,685 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-20 17:56:35,685 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 17:56:35,685 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 17:56:35,686 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 17:56:35,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 17:56:35,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 17:56:35,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:56:35,774 INFO L158 Benchmark]: Toolchain (without parser) took 14805.10ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 97.1MB in the beginning and 214.2MB in the end (delta: -117.1MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,774 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 151.0MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:56:35,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.71ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 82.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.19ms. Allocated memory is still 151.0MB. Free memory was 82.3MB in the beginning and 79.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,775 INFO L158 Benchmark]: Boogie Preprocessor took 53.59ms. Allocated memory is still 151.0MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,775 INFO L158 Benchmark]: RCFGBuilder took 604.92ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 76.6MB in the beginning and 185.4MB in the end (delta: -108.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,775 INFO L158 Benchmark]: TraceAbstraction took 13772.55ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 184.3MB in the beginning and 223.6MB in the end (delta: -39.3MB). Peak memory consumption was 148.4MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,775 INFO L158 Benchmark]: Witness Printer took 101.70ms. Allocated memory is still 283.1MB. Free memory was 223.6MB in the beginning and 214.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 17:56:35,776 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 151.0MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.71ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 82.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.19ms. Allocated memory is still 151.0MB. Free memory was 82.3MB in the beginning and 79.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.59ms. Allocated memory is still 151.0MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 604.92ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 76.6MB in the beginning and 185.4MB in the end (delta: -108.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13772.55ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 184.3MB in the beginning and 223.6MB in the end (delta: -39.3MB). Peak memory consumption was 148.4MB. Max. memory is 16.1GB. * Witness Printer took 101.70ms. Allocated memory is still 283.1MB. Free memory was 223.6MB in the beginning and 214.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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: 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: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: 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: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: 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: 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: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: 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: 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: 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: 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: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 327 locations, 146 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6480 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6480 mSDsluCounter, 6087 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2619 mSDsCounter, 420 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11518 IncrementalHoareTripleChecker+Invalid, 11938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 420 mSolverCounterUnsat, 3468 mSDtfsCounter, 11518 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1962 GetRequests, 1842 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=467occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 724 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3905 NumberOfCodeBlocks, 3628 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4493 ConstructedInterpolants, 0 QuantifiedInterpolants, 10744 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2075 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 42 InterpolantComputations, 22 PerfectInterpolantSequences, 952/1205 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 146 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (1 <= i)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) || ((((((((CCCELVOL3 == 7) && (i == 0)) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-20 17:56:35,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE