./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:07:15,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:07:15,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:07:15,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:07:15,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:07:15,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:07:15,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:07:15,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:07:15,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:07:15,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:07:15,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:07:15,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:07:15,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:07:15,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:07:15,662 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:07:15,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:07:15,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:07:15,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:07:15,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:07:15,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:07:15,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:07:15,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:07:15,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:07:15,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:07:15,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:07:15,667 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:07:15,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:07:15,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:07:15,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:07:15,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:07:15,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:07:15,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:07:15,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:07:15,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:07:15,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:15,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:07:15,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:07:15,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:07:15,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:07:15,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:07:15,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:07:15,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:07:15,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:07:15,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:07:15,672 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-clean/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-clean/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 -> a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 [2024-10-11 20:07:15,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:07:15,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:07:15,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:07:15,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:07:15,958 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:07:15,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c [2024-10-11 20:07:17,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:07:17,570 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:07:17,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c [2024-10-11 20:07:17,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d392b5930/ce96a4ebffc94c2ebcbc0bddd02c14ec/FLAGbc921378f [2024-10-11 20:07:17,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d392b5930/ce96a4ebffc94c2ebcbc0bddd02c14ec [2024-10-11 20:07:17,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:07:17,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:07:17,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:17,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:07:17,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:07:17,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:17" (1/1) ... [2024-10-11 20:07:17,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8d2505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:17, skipping insertion in model container [2024-10-11 20:07:17,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:17" (1/1) ... [2024-10-11 20:07:17,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:07:18,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:18,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:07:18,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:18,259 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:07:18,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18 WrapperNode [2024-10-11 20:07:18,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:18,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:18,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:07:18,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:07:18,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,301 INFO L138 Inliner]: procedures = 15, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-10-11 20:07:18,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:18,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:07:18,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:07:18,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:07:18,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,332 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-10-11 20:07:18,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:07:18,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:07:18,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:07:18,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:07:18,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:18,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:18,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:07:18,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:07:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:07:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:07:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:07:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:07:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:07:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:07:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:07:18,507 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:07:18,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:07:18,797 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-10-11 20:07:18,797 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:07:18,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:07:18,829 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:07:18,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:18 BoogieIcfgContainer [2024-10-11 20:07:18,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:07:18,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:07:18,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:07:18,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:07:18,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:07:17" (1/3) ... [2024-10-11 20:07:18,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378f7fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:18, skipping insertion in model container [2024-10-11 20:07:18,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (2/3) ... [2024-10-11 20:07:18,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378f7fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:18, skipping insertion in model container [2024-10-11 20:07:18,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:18" (3/3) ... [2024-10-11 20:07:18,842 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2024-10-11 20:07:18,860 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:07:18,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-10-11 20:07:18,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:07:18,936 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;@1e42b4da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:07:18,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-10-11 20:07:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 61 states have (on average 1.901639344262295) internal successors, (116), 103 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:18,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:18,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:18,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:18,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1922487027, now seen corresponding path program 1 times [2024-10-11 20:07:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:18,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110639215] [2024-10-11 20:07:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110639215] [2024-10-11 20:07:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110639215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:19,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:19,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613753576] [2024-10-11 20:07:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:19,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:07:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:07:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:07:19,223 INFO L87 Difference]: Start difference. First operand has 104 states, 61 states have (on average 1.901639344262295) internal successors, (116), 103 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:19,265 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2024-10-11 20:07:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:07:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:07:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:19,276 INFO L225 Difference]: With dead ends: 204 [2024-10-11 20:07:19,277 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 20:07:19,280 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-10-11 20:07:19,284 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:19,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 20:07:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 20:07:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 99 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-10-11 20:07:19,330 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 6 [2024-10-11 20:07:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:19,330 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-10-11 20:07:19,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-10-11 20:07:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:19,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:19,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:19,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:07:19,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1922488949, now seen corresponding path program 1 times [2024-10-11 20:07:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077654502] [2024-10-11 20:07:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:19,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:19,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077654502] [2024-10-11 20:07:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077654502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:19,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:19,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963498775] [2024-10-11 20:07:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:19,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:19,620 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:19,679 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-10-11 20:07:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:19,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:07:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:19,682 INFO L225 Difference]: With dead ends: 100 [2024-10-11 20:07:19,682 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 20:07:19,682 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-10-11 20:07:19,684 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:19,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 20:07:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 20:07:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-10-11 20:07:19,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 6 [2024-10-11 20:07:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-10-11 20:07:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-10-11 20:07:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:07:19,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:19,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:07:19,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -532384671, now seen corresponding path program 1 times [2024-10-11 20:07:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144599418] [2024-10-11 20:07:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:19,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144599418] [2024-10-11 20:07:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144599418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:07:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492098025] [2024-10-11 20:07:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:07:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:07:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:07:19,934 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:19,983 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-10-11 20:07:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:07:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:19,985 INFO L225 Difference]: With dead ends: 98 [2024-10-11 20:07:19,985 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 20:07:19,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:07:19,986 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 286 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:19,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 86 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 20:07:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 20:07:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-10-11 20:07:19,994 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 7 [2024-10-11 20:07:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:19,995 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-10-11 20:07:19,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-10-11 20:07:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:07:19,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:19,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:19,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:07:19,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1042549052, now seen corresponding path program 1 times [2024-10-11 20:07:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593121865] [2024-10-11 20:07:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593121865] [2024-10-11 20:07:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593121865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485762030] [2024-10-11 20:07:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:20,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:20,045 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:20,217 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2024-10-11 20:07:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:20,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-11 20:07:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:20,219 INFO L225 Difference]: With dead ends: 168 [2024-10-11 20:07:20,219 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 20:07:20,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:20,220 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:20,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 85 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 20:07:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 20:07:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 135 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2024-10-11 20:07:20,229 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 10 [2024-10-11 20:07:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:20,229 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2024-10-11 20:07:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2024-10-11 20:07:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:07:20,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:20,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:20,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:07:20,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:20,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1652005026, now seen corresponding path program 1 times [2024-10-11 20:07:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514848569] [2024-10-11 20:07:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:20,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514848569] [2024-10-11 20:07:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514848569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044119949] [2024-10-11 20:07:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:20,315 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-10-11 20:07:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:20,422 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2024-10-11 20:07:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 20:07:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:20,424 INFO L225 Difference]: With dead ends: 145 [2024-10-11 20:07:20,424 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 20:07:20,424 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-10-11 20:07:20,425 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:20,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 20:07:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-11 20:07:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 105 states have (on average 1.457142857142857) internal successors, (153), 142 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2024-10-11 20:07:20,456 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 19 [2024-10-11 20:07:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2024-10-11 20:07:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-10-11 20:07:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2024-10-11 20:07:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:07:20,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:20,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:07:20,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 636784931, now seen corresponding path program 1 times [2024-10-11 20:07:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:20,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696973885] [2024-10-11 20:07:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696973885] [2024-10-11 20:07:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696973885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917388342] [2024-10-11 20:07:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:20,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:20,587 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:20,735 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-10-11 20:07:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-11 20:07:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:20,737 INFO L225 Difference]: With dead ends: 147 [2024-10-11 20:07:20,737 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 20:07:20,738 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-10-11 20:07:20,742 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:20,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 141 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 20:07:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-11 20:07:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 107 states have (on average 1.4485981308411215) internal successors, (155), 144 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2024-10-11 20:07:20,755 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 22 [2024-10-11 20:07:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:20,755 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2024-10-11 20:07:20,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2024-10-11 20:07:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:07:20,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:20,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:07:20,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -58332096, now seen corresponding path program 1 times [2024-10-11 20:07:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207913730] [2024-10-11 20:07:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:20,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207913730] [2024-10-11 20:07:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207913730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:07:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123980152] [2024-10-11 20:07:20,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:20,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:20,880 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:21,031 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2024-10-11 20:07:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:21,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 20:07:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:21,032 INFO L225 Difference]: With dead ends: 223 [2024-10-11 20:07:21,033 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 20:07:21,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:21,034 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 168 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:21,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 74 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 20:07:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-11 20:07:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2024-10-11 20:07:21,050 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 26 [2024-10-11 20:07:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:21,050 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2024-10-11 20:07:21,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2024-10-11 20:07:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:07:21,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:21,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:07:21,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:21,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash 884427351, now seen corresponding path program 1 times [2024-10-11 20:07:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551742895] [2024-10-11 20:07:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:21,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551742895] [2024-10-11 20:07:21,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551742895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481213980] [2024-10-11 20:07:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:21,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:21,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:21,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:07:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:21,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:21,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481213980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853062987] [2024-10-11 20:07:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:21,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:21,283 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:21,471 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2024-10-11 20:07:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 20:07:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:21,473 INFO L225 Difference]: With dead ends: 145 [2024-10-11 20:07:21,473 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 20:07:21,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-10-11 20:07:21,475 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 41 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:21,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 130 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 20:07:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 20:07:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 135 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2024-10-11 20:07:21,483 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 28 [2024-10-11 20:07:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:21,483 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2024-10-11 20:07:21,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2024-10-11 20:07:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:07:21,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:21,484 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:21,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:07:21,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:21,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1647444171, now seen corresponding path program 1 times [2024-10-11 20:07:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512180451] [2024-10-11 20:07:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512180451] [2024-10-11 20:07:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512180451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999716389] [2024-10-11 20:07:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:21,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:21,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:21,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:07:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:21,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:21,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999716389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:21,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:21,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:21,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910085427] [2024-10-11 20:07:21,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:21,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:21,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:21,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:21,956 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:22,148 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2024-10-11 20:07:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:22,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 20:07:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:22,151 INFO L225 Difference]: With dead ends: 169 [2024-10-11 20:07:22,151 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 20:07:22,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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-10-11 20:07:22,153 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 136 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:22,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 104 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 20:07:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-10-11 20:07:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 136 states have (on average 1.213235294117647) internal successors, (165), 152 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-10-11 20:07:22,163 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 29 [2024-10-11 20:07:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-10-11 20:07:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-10-11 20:07:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:07:22,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:22,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:22,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:07:22,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:22,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:22,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash 89148436, now seen corresponding path program 1 times [2024-10-11 20:07:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261719601] [2024-10-11 20:07:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261719601] [2024-10-11 20:07:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261719601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265129243] [2024-10-11 20:07:22,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:22,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:22,476 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:22,587 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2024-10-11 20:07:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 20:07:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:22,588 INFO L225 Difference]: With dead ends: 158 [2024-10-11 20:07:22,588 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 20:07:22,588 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-10-11 20:07:22,589 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:22,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 20:07:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-11 20:07:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.20863309352518) internal successors, (168), 155 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2024-10-11 20:07:22,598 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 44 [2024-10-11 20:07:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:22,599 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2024-10-11 20:07:22,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2024-10-11 20:07:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 20:07:22,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:22,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:22,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:07:22,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:22,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1634321480, now seen corresponding path program 1 times [2024-10-11 20:07:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407764184] [2024-10-11 20:07:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407764184] [2024-10-11 20:07:22,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407764184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026107744] [2024-10-11 20:07:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:22,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:22,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:22,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:07:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:22,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:22,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026107744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:22,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:22,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:22,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490667727] [2024-10-11 20:07:22,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:22,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:22,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:22,864 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:23,007 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2024-10-11 20:07:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:23,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 20:07:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:23,008 INFO L225 Difference]: With dead ends: 156 [2024-10-11 20:07:23,008 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 20:07:23,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-10-11 20:07:23,010 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 88 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 20:07:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 20:07:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 139 states have (on average 1.143884892086331) internal successors, (159), 146 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2024-10-11 20:07:23,016 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 50 [2024-10-11 20:07:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2024-10-11 20:07:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2024-10-11 20:07:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 20:07:23,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:23,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:23,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:23,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:23,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:23,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash -875641536, now seen corresponding path program 1 times [2024-10-11 20:07:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043684534] [2024-10-11 20:07:23,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:23,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:23,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043684534] [2024-10-11 20:07:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043684534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:23,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094096026] [2024-10-11 20:07:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:23,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:23,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:23,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:07:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:23,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:23,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094096026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:23,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703479758] [2024-10-11 20:07:23,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:23,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:23,514 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:23,713 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2024-10-11 20:07:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 20:07:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:23,715 INFO L225 Difference]: With dead ends: 180 [2024-10-11 20:07:23,715 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 20:07:23,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 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-10-11 20:07:23,716 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 111 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:23,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 166 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 20:07:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-11 20:07:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 176 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2024-10-11 20:07:23,724 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 51 [2024-10-11 20:07:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:23,725 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2024-10-11 20:07:23,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2024-10-11 20:07:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 20:07:23,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:23,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:23,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:07:23,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:07:23,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash -539258386, now seen corresponding path program 1 times [2024-10-11 20:07:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040253329] [2024-10-11 20:07:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:07:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040253329] [2024-10-11 20:07:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040253329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363769126] [2024-10-11 20:07:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:23,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:23,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:23,987 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:24,077 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2024-10-11 20:07:24,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:24,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 59 [2024-10-11 20:07:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:24,078 INFO L225 Difference]: With dead ends: 177 [2024-10-11 20:07:24,078 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 20:07:24,078 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-10-11 20:07:24,079 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:24,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 78 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 20:07:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-10-11 20:07:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 169 states have (on average 1.136094674556213) internal successors, (192), 175 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2024-10-11 20:07:24,085 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 59 [2024-10-11 20:07:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2024-10-11 20:07:24,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2024-10-11 20:07:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:07:24,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,088 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:07:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:07:24,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash -25999324, now seen corresponding path program 1 times [2024-10-11 20:07:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895500104] [2024-10-11 20:07:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:24,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895500104] [2024-10-11 20:07:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895500104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561198809] [2024-10-11 20:07:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:24,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:24,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:07:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:24,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:24,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:24,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561198809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:24,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:24,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:07:24,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464400342] [2024-10-11 20:07:24,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:24,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:07:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:24,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:07:24,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:24,312 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:24,442 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2024-10-11 20:07:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 20:07:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:24,443 INFO L225 Difference]: With dead ends: 176 [2024-10-11 20:07:24,443 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 20:07:24,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 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-10-11 20:07:24,444 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 83 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:24,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 109 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 20:07:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-10-11 20:07:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 169 states have (on average 1.1301775147928994) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2024-10-11 20:07:24,450 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 62 [2024-10-11 20:07:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,450 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2024-10-11 20:07:24,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2024-10-11 20:07:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:07:24,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,451 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:24,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:24,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:07:24,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:24,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash -805978845, now seen corresponding path program 1 times [2024-10-11 20:07:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:24,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575903546] [2024-10-11 20:07:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:24,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575903546] [2024-10-11 20:07:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575903546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242027481] [2024-10-11 20:07:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:24,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:24,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:07:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:24,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:24,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242027481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:24,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:07:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033918989] [2024-10-11 20:07:24,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:24,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:07:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:07:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:24,930 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:25,150 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2024-10-11 20:07:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:07:25,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 63 [2024-10-11 20:07:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:25,152 INFO L225 Difference]: With dead ends: 197 [2024-10-11 20:07:25,152 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 20:07:25,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:25,155 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:25,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 192 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 20:07:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-11 20:07:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 190 states have (on average 1.131578947368421) internal successors, (215), 195 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 215 transitions. [2024-10-11 20:07:25,162 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 215 transitions. Word has length 63 [2024-10-11 20:07:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:25,162 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 215 transitions. [2024-10-11 20:07:25,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 215 transitions. [2024-10-11 20:07:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 20:07:25,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:25,163 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:25,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:25,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:07:25,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1090953109, now seen corresponding path program 2 times [2024-10-11 20:07:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206960153] [2024-10-11 20:07:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:07:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206960153] [2024-10-11 20:07:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206960153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831544988] [2024-10-11 20:07:25,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:25,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:25,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:25,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:07:25,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:25,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:25,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:25,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 20:07:25,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 20:07:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831544988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:26,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 7 [2024-10-11 20:07:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359840501] [2024-10-11 20:07:26,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:07:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:07:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:07:26,087 INFO L87 Difference]: Start difference. First operand 196 states and 215 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:26,186 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2024-10-11 20:07:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 20:07:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:26,187 INFO L225 Difference]: With dead ends: 196 [2024-10-11 20:07:26,187 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 20:07:26,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:26,188 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:26,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 28 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 20:07:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2024-10-11 20:07:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.105263157894737) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-10-11 20:07:26,193 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 65 [2024-10-11 20:07:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:26,193 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-10-11 20:07:26,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-10-11 20:07:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 20:07:26,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:26,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:26,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:07:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:26,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 681525245, now seen corresponding path program 1 times [2024-10-11 20:07:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33324797] [2024-10-11 20:07:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 20:07:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33324797] [2024-10-11 20:07:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33324797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132517821] [2024-10-11 20:07:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:26,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:26,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:26,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:26,468 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:26,544 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2024-10-11 20:07:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:26,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 81 [2024-10-11 20:07:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:26,546 INFO L225 Difference]: With dead ends: 140 [2024-10-11 20:07:26,546 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 20:07:26,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:26,546 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:26,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 20:07:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 93. [2024-10-11 20:07:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.108695652173913) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-11 20:07:26,551 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 81 [2024-10-11 20:07:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:26,551 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-11 20:07:26,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-11 20:07:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 20:07:26,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:26,552 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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] [2024-10-11 20:07:26,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:07:26,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-11 20:07:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -262803255, now seen corresponding path program 2 times [2024-10-11 20:07:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463391277] [2024-10-11 20:07:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 48 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:27,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:27,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463391277] [2024-10-11 20:07:27,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463391277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6914627] [2024-10-11 20:07:27,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:27,274 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:27,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:07:27,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:27,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:27,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:27,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 20:07:27,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 20:07:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6914627] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:27,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:27,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 3, 3] total 20 [2024-10-11 20:07:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277202944] [2024-10-11 20:07:27,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 20:07:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 20:07:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:07:27,602 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:28,289 INFO L93 Difference]: Finished difference Result 228 states and 250 transitions. [2024-10-11 20:07:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:07:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 0 states have call successors, (0), 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 84 [2024-10-11 20:07:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:28,290 INFO L225 Difference]: With dead ends: 228 [2024-10-11 20:07:28,290 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:07:28,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:07:28,294 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 479 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:28,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 183 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:07:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:07:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:07:28,295 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-10-11 20:07:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:07:28,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-10-11 20:07:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:28,296 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:07:28,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:07:28,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:07:28,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2024-10-11 20:07:28,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2024-10-11 20:07:28,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2024-10-11 20:07:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2024-10-11 20:07:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2024-10-11 20:07:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2024-10-11 20:07:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2024-10-11 20:07:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2024-10-11 20:07:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2024-10-11 20:07:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2024-10-11 20:07:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2024-10-11 20:07:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2024-10-11 20:07:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2024-10-11 20:07:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2024-10-11 20:07:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2024-10-11 20:07:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2024-10-11 20:07:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2024-10-11 20:07:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2024-10-11 20:07:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2024-10-11 20:07:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2024-10-11 20:07:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2024-10-11 20:07:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2024-10-11 20:07:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2024-10-11 20:07:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2024-10-11 20:07:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2024-10-11 20:07:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2024-10-11 20:07:28,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2024-10-11 20:07:28,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2024-10-11 20:07:28,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2024-10-11 20:07:28,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2024-10-11 20:07:28,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2024-10-11 20:07:28,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2024-10-11 20:07:28,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2024-10-11 20:07:28,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2024-10-11 20:07:28,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:07:28,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:07:28,512 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:28,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:07:28,680 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:07:28,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:07:28 BoogieIcfgContainer [2024-10-11 20:07:28,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:07:28,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:07:28,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:07:28,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:07:28,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:18" (3/4) ... [2024-10-11 20:07:28,710 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:07:28,720 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-11 20:07:28,721 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 20:07:28,721 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:07:28,721 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:28,722 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:28,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:07:28,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:07:28,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:07:28,815 INFO L158 Benchmark]: Toolchain (without parser) took 10843.55ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 96.9MB in the beginning and 133.9MB in the end (delta: -37.0MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-10-11 20:07:28,815 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:07:28,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.39ms. Allocated memory is still 151.0MB. Free memory was 96.9MB in the beginning and 83.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:07:28,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.98ms. Allocated memory is still 151.0MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:28,816 INFO L158 Benchmark]: Boogie Preprocessor took 44.87ms. Allocated memory is still 151.0MB. Free memory was 82.2MB in the beginning and 79.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:28,816 INFO L158 Benchmark]: RCFGBuilder took 481.84ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 58.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 20:07:28,816 INFO L158 Benchmark]: TraceAbstraction took 9872.47ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 57.6MB in the beginning and 139.2MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:07:28,817 INFO L158 Benchmark]: Witness Printer took 107.14ms. Allocated memory is still 220.2MB. Free memory was 139.2MB in the beginning and 133.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:07:28,818 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.39ms. Allocated memory is still 151.0MB. Free memory was 96.9MB in the beginning and 83.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.98ms. Allocated memory is still 151.0MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.87ms. Allocated memory is still 151.0MB. Free memory was 82.2MB in the beginning and 79.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.84ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 58.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9872.47ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 57.6MB in the beginning and 139.2MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 107.14ms. Allocated memory is still 220.2MB. Free memory was 139.2MB in the beginning and 133.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 104 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1783 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1783 mSDsluCounter, 2028 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1140 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3199 IncrementalHoareTripleChecker+Invalid, 3340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 888 mSDtfsCounter, 3199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 806 GetRequests, 698 SyntacticMatches, 7 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=15, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1144 NumberOfCodeBlocks, 1026 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1405 ConstructedInterpolants, 0 QuantifiedInterpolants, 4707 SizeOfPredicates, 4 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 522/698 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 42 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((2 <= CELLCOUNT) && (CELLCOUNT <= 2147483647)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1)) * 2))) && (2 <= i)) || ((((i == 1) && (CELLCOUNT <= 2147483647)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1)) * 2))) && (1 <= ((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1))))) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((1 <= i) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1)) * 2))) || ((((i == 0) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1)) * 2)))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((2 <= CELLCOUNT) && (CELLCOUNT <= 2147483647)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1)) * 2))) && (2 <= i)) || ((((i == 1) && (CELLCOUNT <= 2147483647)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1)) * 2))) && (1 <= ((CELLCOUNT >= 0) ? (CELLCOUNT / 2) : ((CELLCOUNT / 2) - 1))))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:07:28,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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