./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pnr5.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 c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:48:48,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:48:48,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 03:48:48,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:48:48,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:48:48,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:48:48,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:48:48,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:48:48,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:48:48,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:48:48,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:48:48,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:48:48,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:48:48,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:48:48,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:48:48,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:48:48,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 03:48:48,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:48:48,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:48:48,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:48:48,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:48:48,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 03:48:48,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:48:48,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 03:48:48,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:48:48,298 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 03:48:48,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:48:48,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:48:48,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 03:48:48,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:48:48,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:48:48,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:48:48,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:48:48,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:48:48,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:48:48,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:48:48,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:48:48,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 03:48:48,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:48:48,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:48:48,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:48:48,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:48:48,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:48:48,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:48:48,303 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 -> c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b [2024-11-17 03:48:48,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:48:48,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:48:48,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:48:48,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:48:48,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:48:48,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr5.c [2024-11-17 03:48:50,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:48:50,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:48:50,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr5.c [2024-11-17 03:48:50,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfb1696e/5dfa17fe893046c1ac58a5c667ea58b5/FLAGba11fceff [2024-11-17 03:48:50,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfb1696e/5dfa17fe893046c1ac58a5c667ea58b5 [2024-11-17 03:48:50,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:48:50,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:48:50,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:48:50,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:48:50,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:48:50,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ec0eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50, skipping insertion in model container [2024-11-17 03:48:50,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:48:50,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:48:50,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:48:50,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:48:50,559 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:48:50,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50 WrapperNode [2024-11-17 03:48:50,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:48:50,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:48:50,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:48:50,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:48:50,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,599 INFO L138 Inliner]: procedures = 17, calls = 34, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-11-17 03:48:50,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:48:50,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:48:50,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:48:50,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:48:50,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,629 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 11, 7]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7]. The 10 writes are split as follows [0, 10, 0]. [2024-11-17 03:48:50,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:48:50,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:48:50,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:48:50,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:48:50,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (1/1) ... [2024-11-17 03:48:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:48:50,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:50,682 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-17 03:48:50,688 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-17 03:48:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:48:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:48:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 03:48:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 03:48:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 03:48:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 03:48:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 03:48:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 03:48:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2024-11-17 03:48:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2024-11-17 03:48:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:48:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:48:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 03:48:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 03:48:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 03:48:50,897 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:48:50,899 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:48:51,285 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-17 03:48:51,285 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:48:51,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:48:51,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:48:51,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:48:51 BoogieIcfgContainer [2024-11-17 03:48:51,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:48:51,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:48:51,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:48:51,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:48:51,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:48:50" (1/3) ... [2024-11-17 03:48:51,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665b9e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:48:51, skipping insertion in model container [2024-11-17 03:48:51,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:48:50" (2/3) ... [2024-11-17 03:48:51,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665b9e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:48:51, skipping insertion in model container [2024-11-17 03:48:51,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:48:51" (3/3) ... [2024-11-17 03:48:51,311 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr5.c [2024-11-17 03:48:51,327 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:48:51,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-17 03:48:51,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:48:51,393 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;@28640109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:48:51,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-17 03:48:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 03:48:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 03:48:51,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:51,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:51,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:51,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 867124285, now seen corresponding path program 1 times [2024-11-17 03:48:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:51,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721237326] [2024-11-17 03:48:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:51,573 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-17 03:48:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721237326] [2024-11-17 03:48:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721237326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:48:51,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215318638] [2024-11-17 03:48:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:51,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:48:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:51,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:48:51,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:48:51,608 INFO L87 Difference]: Start difference. First operand has 143 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-17 03:48:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:51,637 INFO L93 Difference]: Finished difference Result 280 states and 309 transitions. [2024-11-17 03:48:51,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:48:51,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-17 03:48:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:51,646 INFO L225 Difference]: With dead ends: 280 [2024-11-17 03:48:51,646 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 03:48:51,649 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-17 03:48:51,652 INFO L432 NwaCegarLoop]: 154 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, 154 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-17 03:48:51,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:48:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 03:48:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-17 03:48:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 84 states have (on average 1.619047619047619) internal successors, (136), 129 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 03:48:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-17 03:48:51,707 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 8 [2024-11-17 03:48:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-17 03:48:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-17 03:48:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-17 03:48:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 03:48:51,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:51,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:48:51,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash 867154076, now seen corresponding path program 1 times [2024-11-17 03:48:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:51,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868184824] [2024-11-17 03:48:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:51,983 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-17 03:48:51,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:51,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868184824] [2024-11-17 03:48:51,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868184824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:51,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:48:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632718305] [2024-11-17 03:48:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:48:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:48:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:48:51,990 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 03:48:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:52,063 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-17 03:48:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:48:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 03:48:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:52,070 INFO L225 Difference]: With dead ends: 136 [2024-11-17 03:48:52,072 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 03:48:52,072 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-17 03:48:52,073 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:52,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 138 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:48:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 03:48:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 03:48:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 128 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 03:48:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2024-11-17 03:48:52,097 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 8 [2024-11-17 03:48:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:52,097 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2024-11-17 03:48:52,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 03:48:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2024-11-17 03:48:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 03:48:52,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:52,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:48:52,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1111972691, now seen corresponding path program 1 times [2024-11-17 03:48:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508185242] [2024-11-17 03:48:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:52,352 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-17 03:48:52,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:52,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508185242] [2024-11-17 03:48:52,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508185242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:52,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:48:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730883329] [2024-11-17 03:48:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:48:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:48:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:48:52,358 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:48:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:52,532 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-17 03:48:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:48:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 03:48:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:52,535 INFO L225 Difference]: With dead ends: 135 [2024-11-17 03:48:52,535 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 03:48:52,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:48:52,537 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 522 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:52,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 137 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:48:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 03:48:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 03:48:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 127 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 03:48:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2024-11-17 03:48:52,561 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 9 [2024-11-17 03:48:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2024-11-17 03:48:52,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:48:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2024-11-17 03:48:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 03:48:52,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:52,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:52,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:48:52,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 547103026, now seen corresponding path program 1 times [2024-11-17 03:48:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744093955] [2024-11-17 03:48:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:52,670 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-17 03:48:52,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:52,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744093955] [2024-11-17 03:48:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744093955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:48:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246311977] [2024-11-17 03:48:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:48:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:48:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:48:52,673 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:48:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:52,824 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2024-11-17 03:48:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:48:52,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-17 03:48:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:52,826 INFO L225 Difference]: With dead ends: 143 [2024-11-17 03:48:52,826 INFO L226 Difference]: Without dead ends: 141 [2024-11-17 03:48:52,826 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-17 03:48:52,827 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:52,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:48:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-17 03:48:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-11-17 03:48:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 133 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 03:48:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2024-11-17 03:48:52,849 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 16 [2024-11-17 03:48:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:52,850 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2024-11-17 03:48:52,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:48:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2024-11-17 03:48:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 03:48:52,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:52,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:52,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:48:52,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1665160005, now seen corresponding path program 1 times [2024-11-17 03:48:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924484257] [2024-11-17 03:48:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:52,917 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-17 03:48:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924484257] [2024-11-17 03:48:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924484257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:48:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198758834] [2024-11-17 03:48:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:52,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:48:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:52,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:48:52,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:48:52,921 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:48:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:53,125 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2024-11-17 03:48:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:48:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-17 03:48:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:53,127 INFO L225 Difference]: With dead ends: 250 [2024-11-17 03:48:53,127 INFO L226 Difference]: Without dead ends: 210 [2024-11-17 03:48:53,128 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-17 03:48:53,129 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:53,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 134 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:48:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-17 03:48:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-11-17 03:48:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.368421052631579) internal successors, (208), 195 states have internal predecessors, (208), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 03:48:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-11-17 03:48:53,141 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 17 [2024-11-17 03:48:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:53,143 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-11-17 03:48:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:48:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-11-17 03:48:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 03:48:53,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:53,144 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:53,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:48:53,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1636713729, now seen corresponding path program 1 times [2024-11-17 03:48:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745586382] [2024-11-17 03:48:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 03:48:53,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745586382] [2024-11-17 03:48:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745586382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:48:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495171670] [2024-11-17 03:48:53,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:53,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:48:53,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:48:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:48:53,310 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:48:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:53,542 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2024-11-17 03:48:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:48:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 03:48:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:53,547 INFO L225 Difference]: With dead ends: 226 [2024-11-17 03:48:53,547 INFO L226 Difference]: Without dead ends: 210 [2024-11-17 03:48:53,548 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-17 03:48:53,549 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 276 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:53,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 111 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:48:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-17 03:48:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-11-17 03:48:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.361842105263158) internal successors, (207), 195 states have internal predecessors, (207), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 03:48:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2024-11-17 03:48:53,567 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 23 [2024-11-17 03:48:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:53,568 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2024-11-17 03:48:53,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:48:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2024-11-17 03:48:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 03:48:53,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:53,574 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:53,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:48:53,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1409427580, now seen corresponding path program 1 times [2024-11-17 03:48:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360589041] [2024-11-17 03:48:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 03:48:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:53,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360589041] [2024-11-17 03:48:53,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360589041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:53,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:53,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:48:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081636372] [2024-11-17 03:48:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:48:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:48:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:48:53,695 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 03:48:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:53,888 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2024-11-17 03:48:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:48:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-17 03:48:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:53,890 INFO L225 Difference]: With dead ends: 215 [2024-11-17 03:48:53,890 INFO L226 Difference]: Without dead ends: 213 [2024-11-17 03:48:53,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-17 03:48:53,891 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:53,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 216 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:48:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-17 03:48:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2024-11-17 03:48:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 200 states have internal predecessors, (212), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 03:48:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 232 transitions. [2024-11-17 03:48:53,909 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 232 transitions. Word has length 67 [2024-11-17 03:48:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 232 transitions. [2024-11-17 03:48:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 03:48:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 232 transitions. [2024-11-17 03:48:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 03:48:53,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:53,915 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 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] [2024-11-17 03:48:53,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:48:53,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:53,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash -194630616, now seen corresponding path program 1 times [2024-11-17 03:48:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287308547] [2024-11-17 03:48:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-17 03:48:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 03:48:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287308547] [2024-11-17 03:48:54,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287308547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:48:54,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618804545] [2024-11-17 03:48:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:54,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:54,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:54,087 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-17 03:48:54,090 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-17 03:48:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:48:54,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:48:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 03:48:54,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:48:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618804545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:54,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:48:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-17 03:48:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928447769] [2024-11-17 03:48:54,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:54,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:48:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:48:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:48:54,353 INFO L87 Difference]: Start difference. First operand 212 states and 232 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-17 03:48:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:54,605 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2024-11-17 03:48:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:48:54,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2024-11-17 03:48:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:54,607 INFO L225 Difference]: With dead ends: 212 [2024-11-17 03:48:54,607 INFO L226 Difference]: Without dead ends: 191 [2024-11-17 03:48:54,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 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-17 03:48:54,611 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 93 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:54,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 186 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:48:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-17 03:48:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-17 03:48:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.21656050955414) internal successors, (191), 179 states have internal predecessors, (191), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 03:48:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2024-11-17 03:48:54,622 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 80 [2024-11-17 03:48:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:54,622 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2024-11-17 03:48:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-17 03:48:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2024-11-17 03:48:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 03:48:54,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:54,624 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 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] [2024-11-17 03:48:54,644 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-17 03:48:54,824 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-17 03:48:54,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1738581708, now seen corresponding path program 1 times [2024-11-17 03:48:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995267328] [2024-11-17 03:48:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-17 03:48:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 03:48:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995267328] [2024-11-17 03:48:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995267328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:48:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750683572] [2024-11-17 03:48:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:54,948 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-17 03:48:54,949 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-17 03:48:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:55,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:48:55,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:48:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 03:48:55,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:48:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 03:48:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750683572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:48:55,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:48:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-17 03:48:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001276575] [2024-11-17 03:48:55,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:48:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:48:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:48:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:48:55,271 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-17 03:48:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:55,633 INFO L93 Difference]: Finished difference Result 279 states and 333 transitions. [2024-11-17 03:48:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:48:55,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 81 [2024-11-17 03:48:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:55,636 INFO L225 Difference]: With dead ends: 279 [2024-11-17 03:48:55,637 INFO L226 Difference]: Without dead ends: 258 [2024-11-17 03:48:55,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 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-17 03:48:55,638 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 223 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:55,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 190 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 03:48:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-17 03:48:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-17 03:48:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 236 states have (on average 1.1016949152542372) internal successors, (260), 240 states have internal predecessors, (260), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 03:48:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 292 transitions. [2024-11-17 03:48:55,655 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 292 transitions. Word has length 81 [2024-11-17 03:48:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:55,655 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 292 transitions. [2024-11-17 03:48:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-17 03:48:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 292 transitions. [2024-11-17 03:48:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-17 03:48:55,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:55,657 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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] [2024-11-17 03:48:55,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 03:48:55,863 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-17 03:48:55,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash 704388514, now seen corresponding path program 1 times [2024-11-17 03:48:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:55,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159488984] [2024-11-17 03:48:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:48:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159488984] [2024-11-17 03:48:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159488984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:48:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051648591] [2024-11-17 03:48:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:56,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:56,014 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-17 03:48:56,016 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-17 03:48:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:48:56,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:48:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:48:56,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:48:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051648591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:48:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 03:48:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766863843] [2024-11-17 03:48:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:48:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:48:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:48:56,139 INFO L87 Difference]: Start difference. First operand 258 states and 292 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 03:48:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:56,327 INFO L93 Difference]: Finished difference Result 259 states and 293 transitions. [2024-11-17 03:48:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:48:56,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2024-11-17 03:48:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:56,330 INFO L225 Difference]: With dead ends: 259 [2024-11-17 03:48:56,330 INFO L226 Difference]: Without dead ends: 258 [2024-11-17 03:48:56,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 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-17 03:48:56,331 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 140 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:56,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 180 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:48:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-17 03:48:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2024-11-17 03:48:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 236 states have (on average 1.097457627118644) internal successors, (259), 239 states have internal predecessors, (259), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 03:48:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 291 transitions. [2024-11-17 03:48:56,342 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 291 transitions. Word has length 86 [2024-11-17 03:48:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:56,343 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 291 transitions. [2024-11-17 03:48:56,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 03:48:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 291 transitions. [2024-11-17 03:48:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 03:48:56,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:56,344 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:48:56,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 03:48:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:56,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:56,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 361207431, now seen corresponding path program 1 times [2024-11-17 03:48:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083327801] [2024-11-17 03:48:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:48:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083327801] [2024-11-17 03:48:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083327801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:48:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390315300] [2024-11-17 03:48:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:56,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:56,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:56,691 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-17 03:48:56,697 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-17 03:48:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:56,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:48:56,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:48:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:48:56,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:48:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:48:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390315300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:48:56,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:48:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-17 03:48:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520742260] [2024-11-17 03:48:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:48:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 03:48:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 03:48:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:48:56,899 INFO L87 Difference]: Start difference. First operand 257 states and 291 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 03:48:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:57,167 INFO L93 Difference]: Finished difference Result 279 states and 315 transitions. [2024-11-17 03:48:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:48:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2024-11-17 03:48:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:57,170 INFO L225 Difference]: With dead ends: 279 [2024-11-17 03:48:57,171 INFO L226 Difference]: Without dead ends: 278 [2024-11-17 03:48:57,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 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-17 03:48:57,172 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 256 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:57,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 171 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:48:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-17 03:48:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-17 03:48:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.0894941634241244) internal successors, (280), 260 states have internal predecessors, (280), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 03:48:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 312 transitions. [2024-11-17 03:48:57,186 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 312 transitions. Word has length 87 [2024-11-17 03:48:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:57,187 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 312 transitions. [2024-11-17 03:48:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 03:48:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 312 transitions. [2024-11-17 03:48:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 03:48:57,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:57,188 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-17 03:48:57,205 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-17 03:48:57,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:57,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1734417562, now seen corresponding path program 2 times [2024-11-17 03:48:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343220491] [2024-11-17 03:48:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:57,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:57,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:48:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343220491] [2024-11-17 03:48:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343220491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:48:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772300356] [2024-11-17 03:48:57,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:48:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:57,612 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-17 03:48:57,614 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-17 03:48:57,680 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:48:57,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:48:57,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:48:57,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:48:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-17 03:48:57,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:48:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-17 03:48:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772300356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:48:57,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:48:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-17 03:48:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568990083] [2024-11-17 03:48:57,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:48:57,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 03:48:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 03:48:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-17 03:48:57,981 INFO L87 Difference]: Start difference. First operand 278 states and 312 transitions. Second operand has 15 states, 14 states have (on average 10.785714285714286) internal successors, (151), 15 states have internal predecessors, (151), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-17 03:48:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:58,381 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2024-11-17 03:48:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 03:48:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.785714285714286) internal successors, (151), 15 states have internal predecessors, (151), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-17 03:48:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:58,383 INFO L225 Difference]: With dead ends: 288 [2024-11-17 03:48:58,383 INFO L226 Difference]: Without dead ends: 242 [2024-11-17 03:48:58,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-17 03:48:58,384 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 270 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:58,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 168 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 03:48:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-17 03:48:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-17 03:48:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 222 states have (on average 1.0855855855855856) internal successors, (241), 224 states have internal predecessors, (241), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 03:48:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2024-11-17 03:48:58,394 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 108 [2024-11-17 03:48:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:58,394 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2024-11-17 03:48:58,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.785714285714286) internal successors, (151), 15 states have internal predecessors, (151), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-17 03:48:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2024-11-17 03:48:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-17 03:48:58,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:58,396 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:58,413 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-17 03:48:58,596 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,SelfDestructingSolverStorable11 [2024-11-17 03:48:58,597 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:58,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1107792734, now seen corresponding path program 1 times [2024-11-17 03:48:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961332115] [2024-11-17 03:48:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-17 03:48:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-17 03:48:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-17 03:48:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-17 03:48:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-17 03:48:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-17 03:48:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-17 03:48:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-17 03:48:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-17 03:48:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-17 03:48:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-17 03:48:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:58,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961332115] [2024-11-17 03:48:58,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961332115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:48:58,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:48:58,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:48:58,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816871839] [2024-11-17 03:48:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:48:58,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:48:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:48:58,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:48:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:48:58,730 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-17 03:48:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:48:58,816 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2024-11-17 03:48:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:48:58,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 194 [2024-11-17 03:48:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:48:58,818 INFO L225 Difference]: With dead ends: 242 [2024-11-17 03:48:58,818 INFO L226 Difference]: Without dead ends: 241 [2024-11-17 03:48:58,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-17 03:48:58,819 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:48:58,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:48:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-17 03:48:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-17 03:48:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 222 states have (on average 1.0810810810810811) internal successors, (240), 223 states have internal predecessors, (240), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 03:48:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2024-11-17 03:48:58,830 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 194 [2024-11-17 03:48:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:48:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2024-11-17 03:48:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-17 03:48:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2024-11-17 03:48:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-17 03:48:58,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:48:58,833 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:48:58,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:48:58,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-17 03:48:58,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:48:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1212299052, now seen corresponding path program 2 times [2024-11-17 03:48:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:48:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322977887] [2024-11-17 03:48:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:48:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:48:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-17 03:48:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 03:48:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 03:48:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 03:48:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 03:48:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-17 03:48:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-17 03:48:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-17 03:48:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-17 03:48:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-17 03:48:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-17 03:48:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-17 03:48:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-17 03:48:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-17 03:48:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-17 03:48:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-17 03:48:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:48:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-17 03:48:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:48:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322977887] [2024-11-17 03:48:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322977887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:48:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932973142] [2024-11-17 03:48:59,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:48:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:48:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:48:59,354 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-17 03:48:59,355 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-17 03:48:59,441 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:48:59,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:48:59,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:48:59,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:49:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-11-17 03:49:00,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:49:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-17 03:49:00,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932973142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:49:00,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:49:00,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 10 [2024-11-17 03:49:00,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045770628] [2024-11-17 03:49:00,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:49:00,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:49:00,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:49:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:49:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:49:00,417 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-17 03:49:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:49:00,592 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-11-17 03:49:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:49:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 207 [2024-11-17 03:49:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:49:00,594 INFO L225 Difference]: With dead ends: 241 [2024-11-17 03:49:00,594 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 03:49:00,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-11-17 03:49:00,595 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 471 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:49:00,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:49:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 03:49:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 03:49:00,598 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-17 03:49:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 03:49:00,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2024-11-17 03:49:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:49:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 03:49:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-17 03:49:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 03:49:00,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 03:49:00,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2024-11-17 03:49:00,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2024-11-17 03:49:00,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2024-11-17 03:49:00,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2024-11-17 03:49:00,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2024-11-17 03:49:00,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2024-11-17 03:49:00,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2024-11-17 03:49:00,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2024-11-17 03:49:00,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2024-11-17 03:49:00,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2024-11-17 03:49:00,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2024-11-17 03:49:00,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2024-11-17 03:49:00,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2024-11-17 03:49:00,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2024-11-17 03:49:00,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2024-11-17 03:49:00,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2024-11-17 03:49:00,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2024-11-17 03:49:00,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2024-11-17 03:49:00,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2024-11-17 03:49:00,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2024-11-17 03:49:00,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2024-11-17 03:49:00,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2024-11-17 03:49:00,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2024-11-17 03:49:00,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2024-11-17 03:49:00,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2024-11-17 03:49:00,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2024-11-17 03:49:00,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2024-11-17 03:49:00,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2024-11-17 03:49:00,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2024-11-17 03:49:00,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2024-11-17 03:49:00,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2024-11-17 03:49:00,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2024-11-17 03:49:00,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2024-11-17 03:49:00,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:49:00,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:49:00,817 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:49:00,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 03:49:01,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:49:01,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:49:01 BoogieIcfgContainer [2024-11-17 03:49:01,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:49:01,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:49:01,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:49:01,272 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:49:01,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:48:51" (3/4) ... [2024-11-17 03:49:01,274 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 03:49:01,278 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2024-11-17 03:49:01,287 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-17 03:49:01,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-17 03:49:01,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-17 03:49:01,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 03:49:01,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 03:49:01,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 03:49:01,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 03:49:01,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:49:01,399 INFO L158 Benchmark]: Toolchain (without parser) took 11142.91ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 88.4MB in the beginning and 168.6MB in the end (delta: -80.2MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,399 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 165.7MB. Free memory was 132.7MB in the beginning and 132.4MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:49:01,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.86ms. Allocated memory is still 165.7MB. Free memory was 88.0MB in the beginning and 135.5MB in the end (delta: -47.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.78ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,400 INFO L158 Benchmark]: Boogie Preprocessor took 46.86ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,400 INFO L158 Benchmark]: IcfgBuilder took 655.31ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 118.3MB in the end (delta: 13.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,400 INFO L158 Benchmark]: TraceAbstraction took 9965.49ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 117.2MB in the beginning and 174.9MB in the end (delta: -57.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,401 INFO L158 Benchmark]: Witness Printer took 126.41ms. Allocated memory is still 287.3MB. Free memory was 174.9MB in the beginning and 168.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 03:49:01,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 165.7MB. Free memory was 132.7MB in the beginning and 132.4MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.86ms. Allocated memory is still 165.7MB. Free memory was 88.0MB in the beginning and 135.5MB in the end (delta: -47.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.78ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.86ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 655.31ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 118.3MB in the end (delta: 13.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9965.49ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 117.2MB in the beginning and 174.9MB in the end (delta: -57.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 126.41ms. Allocated memory is still 287.3MB. Free memory was 174.9MB in the beginning and 168.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: 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: 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: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 143 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2688 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2652 mSDsluCounter, 2235 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1087 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2517 IncrementalHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 1148 mSDtfsCounter, 2517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1246 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 6661 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1060 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 2605/2851 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 46 specifications checked. All of them hold - InvariantResult [Line: 89]: Location Invariant Derived location invariant: null - InvariantResult [Line: 36]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 12]: Procedure Contract for ReadFromPort Derived contract for procedure ReadFromPort. Requires: ((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) Ensures: (((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) && ((SIZE == \old(SIZE)) && (MAX == \old(MAX)))) RESULT: Ultimate proved your program to be correct! [2024-11-17 03:49:01,435 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