./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-crafted/bor1.i --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-crafted/bor1.i -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 dc029b09d1398b404e1aee83359480f2bc7a4040f694547fb82d365d81b9786a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:07:57,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:07:57,442 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:57,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:07:57,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:07:57,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:07:57,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:07:57,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:07:57,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:07:57,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:07:57,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:07:57,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:07:57,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:07:57,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:07:57,465 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:07:57,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:07:57,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:07:57,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:07:57,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:07:57,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:07:57,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:07:57,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:07:57,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:07:57,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:07:57,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:07:57,472 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:07:57,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:07:57,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:07:57,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:07:57,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:07:57,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:07:57,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:07:57,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:07:57,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:07:57,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:57,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:07:57,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:07:57,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:07:57,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:07:57,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:07:57,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:07:57,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:07:57,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:07:57,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:07:57,479 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 -> dc029b09d1398b404e1aee83359480f2bc7a4040f694547fb82d365d81b9786a [2024-10-11 20:07:57,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:07:57,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:07:57,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:07:57,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:07:57,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:07:57,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor1.i [2024-10-11 20:07:58,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:07:59,125 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:07:59,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor1.i [2024-10-11 20:07:59,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11103b7dc/03df1ca7108d4e078f5c3482bd70c208/FLAG9ed751974 [2024-10-11 20:07:59,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11103b7dc/03df1ca7108d4e078f5c3482bd70c208 [2024-10-11 20:07:59,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:07:59,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:07:59,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:59,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:07:59,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:07:59,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:59" (1/1) ... [2024-10-11 20:07:59,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7d9b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:59, skipping insertion in model container [2024-10-11 20:07:59,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:59" (1/1) ... [2024-10-11 20:07:59,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:07:59,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:59,783 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:07:59,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:59,813 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:07:59,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:59 WrapperNode [2024-10-11 20:07:59,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:59,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:59,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:07:59,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:07:59,821 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:59" (1/1) ... [2024-10-11 20:07:59,825 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:59" (1/1) ... [2024-10-11 20:07:59,840 INFO L138 Inliner]: procedures = 16, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-10-11 20:07:59,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:59,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:07:59,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:07:59,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:07:59,850 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:59" (1/1) ... [2024-10-11 20:07:59,850 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:59" (1/1) ... [2024-10-11 20:07:59,852 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:59" (1/1) ... [2024-10-11 20:07:59,863 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-10-11 20:07:59,863 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:59" (1/1) ... [2024-10-11 20:07:59,863 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:59" (1/1) ... [2024-10-11 20:07:59,868 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:59" (1/1) ... [2024-10-11 20:07:59,871 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:59" (1/1) ... [2024-10-11 20:07:59,872 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:59" (1/1) ... [2024-10-11 20:07:59,873 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:59" (1/1) ... [2024-10-11 20:07:59,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:07:59,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:07:59,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:07:59,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:07:59,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:59" (1/1) ... [2024-10-11 20:07:59,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:59,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:59,912 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:59,915 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:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:07:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2024-10-11 20:07:59,954 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2024-10-11 20:07:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:07:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:07:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:07:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:07:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:07:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:07:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:07:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:07:59,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:07:59,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:07:59,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:07:59,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:07:59,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:08:00,035 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:08:00,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:08:00,233 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 20:08:00,235 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:08:00,268 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:08:00,269 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:08:00,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:08:00 BoogieIcfgContainer [2024-10-11 20:08:00,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:08:00,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:08:00,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:08:00,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:08:00,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:07:59" (1/3) ... [2024-10-11 20:08:00,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f2bece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:08:00, skipping insertion in model container [2024-10-11 20:08:00,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:59" (2/3) ... [2024-10-11 20:08:00,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f2bece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:08:00, skipping insertion in model container [2024-10-11 20:08:00,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:08:00" (3/3) ... [2024-10-11 20:08:00,278 INFO L112 eAbstractionObserver]: Analyzing ICFG bor1.i [2024-10-11 20:08:00,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:08:00,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 20:08:00,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:08:00,357 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;@f44827c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:08:00,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 20:08:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:08:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:08:00,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:00,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:08:00,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:00,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 137035, now seen corresponding path program 1 times [2024-10-11 20:08:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067031579] [2024-10-11 20:08:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:00,618 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:08:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:00,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067031579] [2024-10-11 20:08:00,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067031579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:00,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:08:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520601836] [2024-10-11 20:08:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:00,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:00,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:00,647 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:00,692 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-11 20:08:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-11 20:08:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:00,700 INFO L225 Difference]: With dead ends: 78 [2024-10-11 20:08:00,700 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:08:00,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:08:00,704 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:00,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:08:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 20:08:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-11 20:08:00,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 3 [2024-10-11 20:08:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:00,773 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-11 20:08:00,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-11 20:08:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:08:00,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:00,801 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-11 20:08:00,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:08:00,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:00,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash -212477275, now seen corresponding path program 1 times [2024-10-11 20:08:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846867432] [2024-10-11 20:08:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:00,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846867432] [2024-10-11 20:08:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846867432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947012512] [2024-10-11 20:08:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:00,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:00,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:00,906 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:08:00,907 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:08:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:00,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:08:00,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:01,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:08:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947012512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:08:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:08:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461117972] [2024-10-11 20:08:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:08:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:08:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:08:01,010 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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:08:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:01,051 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-11 20:08:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:08:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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:08:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:01,052 INFO L225 Difference]: With dead ends: 37 [2024-10-11 20:08:01,052 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 20:08:01,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:08:01,053 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:01,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 20:08:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 20:08:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-11 20:08:01,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 6 [2024-10-11 20:08:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:01,059 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-11 20:08:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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:08:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-10-11 20:08:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:08:01,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:01,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-10-11 20:08:01,074 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:08:01,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:01,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:01,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2003139146, now seen corresponding path program 1 times [2024-10-11 20:08:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679410419] [2024-10-11 20:08:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:08:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679410419] [2024-10-11 20:08:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679410419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:08:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371233850] [2024-10-11 20:08:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:01,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:08:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:08:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:08:01,316 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:08:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:01,343 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-11 20:08:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:08:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:08:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:01,345 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:08:01,345 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 20:08:01,345 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:08:01,346 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:01,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 20:08:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 20:08:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-11 20:08:01,355 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2024-10-11 20:08:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:01,355 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-11 20:08:01,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:08:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-11 20:08:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:08:01,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:01,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:01,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:08:01,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:01,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1577275360, now seen corresponding path program 1 times [2024-10-11 20:08:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:01,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470168472] [2024-10-11 20:08:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470168472] [2024-10-11 20:08:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470168472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139712133] [2024-10-11 20:08:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:01,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:01,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:01,527 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:08:01,528 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:08:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:01,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:08:01,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:01,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139712133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:01,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:01,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:08:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074980487] [2024-10-11 20:08:01,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:01,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:08:01,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:01,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:08:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:08:01,645 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:01,685 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-10-11 20:08:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:08:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 20:08:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:01,686 INFO L225 Difference]: With dead ends: 67 [2024-10-11 20:08:01,687 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:08:01,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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:08:01,688 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:01,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:08:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 20:08:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 20:08:01,693 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-10-11 20:08:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:01,693 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 20:08:01,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 20:08:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:08:01,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:01,694 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:01,707 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:08:01,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:01,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:01,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -975331744, now seen corresponding path program 2 times [2024-10-11 20:08:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849120617] [2024-10-11 20:08:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:08:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849120617] [2024-10-11 20:08:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849120617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571902100] [2024-10-11 20:08:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:01,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:01,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:01,948 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:01,972 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-10-11 20:08:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:01,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 20:08:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:01,974 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:08:01,974 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 20:08:01,974 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:08:01,975 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:01,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 20:08:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 20:08:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-11 20:08:01,980 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2024-10-11 20:08:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:01,980 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-11 20:08:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-11 20:08:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:08:01,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:01,981 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:08:01,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1594127892, now seen corresponding path program 1 times [2024-10-11 20:08:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101193064] [2024-10-11 20:08:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101193064] [2024-10-11 20:08:02,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101193064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955278313] [2024-10-11 20:08:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:02,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:02,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:02,155 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:08:02,156 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:08:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:02,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:08:02,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:02,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955278313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:02,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-10-11 20:08:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101963181] [2024-10-11 20:08:02,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:02,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:08:02,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:08:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:08:02,391 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:02,446 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2024-10-11 20:08:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:08:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 20:08:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:02,447 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:08:02,448 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 20:08:02,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:08:02,449 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:02,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 20:08:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 20:08:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 54 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-10-11 20:08:02,454 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2024-10-11 20:08:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-11 20:08:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-10-11 20:08:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:08:02,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:02,455 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:02,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:08:02,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:02,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:02,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1108643180, now seen corresponding path program 2 times [2024-10-11 20:08:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142580807] [2024-10-11 20:08:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142580807] [2024-10-11 20:08:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142580807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292849399] [2024-10-11 20:08:02,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:08:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:02,973 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:08:02,974 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:08:03,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:08:03,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:08:03,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:08:03,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:03,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292849399] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:03,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2024-10-11 20:08:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208563653] [2024-10-11 20:08:03,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:03,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 20:08:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:03,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 20:08:03,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:08:03,356 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:03,424 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2024-10-11 20:08:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 20:08:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 20:08:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:03,426 INFO L225 Difference]: With dead ends: 117 [2024-10-11 20:08:03,426 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 20:08:03,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:08:03,427 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:03,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 20:08:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 20:08:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-11 20:08:03,434 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 35 [2024-10-11 20:08:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:03,434 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-11 20:08:03,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-11 20:08:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 20:08:03,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:03,435 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:03,449 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:08:03,639 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,SelfDestructingSolverStorable6 [2024-10-11 20:08:03,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1620388756, now seen corresponding path program 3 times [2024-10-11 20:08:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343963027] [2024-10-11 20:08:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:08:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:04,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343963027] [2024-10-11 20:08:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343963027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:04,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941942528] [2024-10-11 20:08:04,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:08:04,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:04,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:04,421 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:08:04,422 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:08:04,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:08:04,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:08:04,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:08:04,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-11 20:08:04,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:08:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941942528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:04,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:08:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [32] total 37 [2024-10-11 20:08:04,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177813256] [2024-10-11 20:08:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:08:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:08:04,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 20:08:04,615 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:04,666 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-11 20:08:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:08:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:08:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:04,671 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:08:04,671 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 20:08:04,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 20:08:04,676 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:04,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 20:08:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 20:08:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-11 20:08:04,690 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 59 [2024-10-11 20:08:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:04,690 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-11 20:08:04,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-11 20:08:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 20:08:04,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:04,692 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:04,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:08:04,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:04,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1307556173, now seen corresponding path program 1 times [2024-10-11 20:08:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475434463] [2024-10-11 20:08:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-10-11 20:08:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475434463] [2024-10-11 20:08:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475434463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344534721] [2024-10-11 20:08:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:04,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:04,990 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:05,008 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-10-11 20:08:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 20:08:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:05,009 INFO L225 Difference]: With dead ends: 81 [2024-10-11 20:08:05,010 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:08:05,010 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:08:05,011 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:05,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:08:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-11 20:08:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.123076923076923) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-11 20:08:05,021 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 60 [2024-10-11 20:08:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:05,021 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-11 20:08:05,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-11 20:08:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 20:08:05,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:05,022 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:05,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:08:05,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:05,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042508, now seen corresponding path program 1 times [2024-10-11 20:08:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545388098] [2024-10-11 20:08:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 20:08:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:08:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-11 20:08:05,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:05,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545388098] [2024-10-11 20:08:05,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545388098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:05,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297387246] [2024-10-11 20:08:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:05,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:05,184 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:08:05,186 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:08:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:08:05,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-11 20:08:05,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:08:05,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297387246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:05,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:08:05,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 20:08:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477227060] [2024-10-11 20:08:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:05,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:08:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:05,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:08:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:05,294 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:05,310 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-10-11 20:08:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:08:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2024-10-11 20:08:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:05,312 INFO L225 Difference]: With dead ends: 76 [2024-10-11 20:08:05,312 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 20:08:05,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:05,313 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:05,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 20:08:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-10-11 20:08:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-10-11 20:08:05,324 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 72 [2024-10-11 20:08:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:05,325 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-10-11 20:08:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-10-11 20:08:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 20:08:05,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:05,326 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:05,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:08:05,526 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,SelfDestructingSolverStorable9 [2024-10-11 20:08:05,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:05,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 864388015, now seen corresponding path program 1 times [2024-10-11 20:08:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:05,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581133054] [2024-10-11 20:08:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 20:08:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:08:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-11 20:08:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:05,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581133054] [2024-10-11 20:08:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581133054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490043996] [2024-10-11 20:08:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:05,640 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:08:05,642 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:08:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:05,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:08:05,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-11 20:08:05,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:08:05,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490043996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:05,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:08:05,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 20:08:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971949403] [2024-10-11 20:08:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:05,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:08:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:08:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:05,740 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:05,755 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-10-11 20:08:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:08:05,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-10-11 20:08:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:05,756 INFO L225 Difference]: With dead ends: 76 [2024-10-11 20:08:05,756 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 20:08:05,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:05,756 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:05,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 20:08:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 20:08:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-10-11 20:08:05,761 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 73 [2024-10-11 20:08:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:05,761 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-10-11 20:08:05,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-10-11 20:08:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 20:08:05,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:05,762 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:05,775 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:08:05,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:05,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:05,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1026226094, now seen corresponding path program 1 times [2024-10-11 20:08:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405455436] [2024-10-11 20:08:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:06,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 20:08:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:08:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-11 20:08:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405455436] [2024-10-11 20:08:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405455436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:06,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807897692] [2024-10-11 20:08:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:06,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:06,083 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:08:06,088 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:08:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:06,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 20:08:06,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 20:08:06,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 20:08:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807897692] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:07,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 32, 33] total 67 [2024-10-11 20:08:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682206450] [2024-10-11 20:08:07,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-11 20:08:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-11 20:08:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 20:08:07,422 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 67 states, 67 states have (on average 1.9402985074626866) internal successors, (130), 67 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:08:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:07,579 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2024-10-11 20:08:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-11 20:08:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9402985074626866) internal successors, (130), 67 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2024-10-11 20:08:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:07,580 INFO L225 Difference]: With dead ends: 162 [2024-10-11 20:08:07,580 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 20:08:07,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 20:08:07,582 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:07,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 359 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 20:08:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2024-10-11 20:08:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 123 states have (on average 1.08130081300813) internal successors, (133), 126 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2024-10-11 20:08:07,587 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 74 [2024-10-11 20:08:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:07,587 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2024-10-11 20:08:07,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9402985074626866) internal successors, (130), 67 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:08:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2024-10-11 20:08:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 20:08:07,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:07,589 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:07,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:08:07,792 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,SelfDestructingSolverStorable11 [2024-10-11 20:08:07,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash 623427410, now seen corresponding path program 2 times [2024-10-11 20:08:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:07,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700108286] [2024-10-11 20:08:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:08:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:08:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2024-10-11 20:08:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700108286] [2024-10-11 20:08:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700108286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:07,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961898421] [2024-10-11 20:08:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:07,943 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:07,967 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2024-10-11 20:08:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 132 [2024-10-11 20:08:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:07,968 INFO L225 Difference]: With dead ends: 134 [2024-10-11 20:08:07,968 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 20:08:07,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:08:07,969 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:07,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 20:08:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 20:08:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.08) internal successors, (135), 128 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2024-10-11 20:08:07,976 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 132 [2024-10-11 20:08:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2024-10-11 20:08:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2024-10-11 20:08:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 20:08:07,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:07,978 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:07,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:08:07,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:07,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1087487353, now seen corresponding path program 1 times [2024-10-11 20:08:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788351352] [2024-10-11 20:08:07,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:07,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:08:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:08:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2024-10-11 20:08:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788351352] [2024-10-11 20:08:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788351352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316902363] [2024-10-11 20:08:08,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:08,108 INFO L229 MonitoredProcess]: Starting monitored process 10 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:08:08,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:08:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:08,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 20:08:08,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 20:08:09,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 20:08:12,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316902363] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:12,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 64, 65] total 131 [2024-10-11 20:08:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543316835] [2024-10-11 20:08:12,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2024-10-11 20:08:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2024-10-11 20:08:12,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4166, Invalid=12864, Unknown=0, NotChecked=0, Total=17030 [2024-10-11 20:08:12,447 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 131 states, 131 states have (on average 1.7557251908396947) internal successors, (230), 131 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:08:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:12,927 INFO L93 Difference]: Finished difference Result 268 states and 315 transitions. [2024-10-11 20:08:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-10-11 20:08:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.7557251908396947) internal successors, (230), 131 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 135 [2024-10-11 20:08:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:12,932 INFO L225 Difference]: With dead ends: 268 [2024-10-11 20:08:12,933 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 20:08:12,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4166, Invalid=12864, Unknown=0, NotChecked=0, Total=17030 [2024-10-11 20:08:12,940 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:12,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 316 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:08:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 20:08:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2024-10-11 20:08:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 223 states have (on average 1.0448430493273542) internal successors, (233), 226 states have internal predecessors, (233), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 237 transitions. [2024-10-11 20:08:12,956 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 237 transitions. Word has length 135 [2024-10-11 20:08:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 237 transitions. [2024-10-11 20:08:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.7557251908396947) internal successors, (230), 131 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:08:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 237 transitions. [2024-10-11 20:08:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 20:08:12,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:12,958 INFO L215 NwaCegarLoop]: trace histogram [63, 63, 63, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:12,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:08:13,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:13,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:13,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1489786378, now seen corresponding path program 1 times [2024-10-11 20:08:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925807448] [2024-10-11 20:08:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:08:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 20:08:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5967 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5965 trivial. 0 not checked. [2024-10-11 20:08:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925807448] [2024-10-11 20:08:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925807448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:13,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:08:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54585163] [2024-10-11 20:08:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:13,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:08:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:08:13,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:08:13,463 INFO L87 Difference]: Start difference. First operand 230 states and 237 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:13,486 INFO L93 Difference]: Finished difference Result 230 states and 237 transitions. [2024-10-11 20:08:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:08:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-10-11 20:08:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:13,488 INFO L225 Difference]: With dead ends: 230 [2024-10-11 20:08:13,492 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 20:08:13,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:08:13,493 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:13,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 20:08:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-11 20:08:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 223 states have (on average 1.0403587443946187) internal successors, (232), 225 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 236 transitions. [2024-10-11 20:08:13,506 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 236 transitions. Word has length 232 [2024-10-11 20:08:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:13,508 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 236 transitions. [2024-10-11 20:08:13,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 236 transitions. [2024-10-11 20:08:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 20:08:13,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:13,512 INFO L215 NwaCegarLoop]: trace histogram [63, 63, 63, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:13,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:08:13,512 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:13,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1061261133, now seen corresponding path program 1 times [2024-10-11 20:08:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:13,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902576218] [2024-10-11 20:08:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:08:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 20:08:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5968 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5966 trivial. 0 not checked. [2024-10-11 20:08:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902576218] [2024-10-11 20:08:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902576218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459686935] [2024-10-11 20:08:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:13,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:13,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:13,823 INFO L87 Difference]: Start difference. First operand 229 states and 236 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:13,855 INFO L93 Difference]: Finished difference Result 229 states and 236 transitions. [2024-10-11 20:08:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:13,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2024-10-11 20:08:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:13,857 INFO L225 Difference]: With dead ends: 229 [2024-10-11 20:08:13,861 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 20:08:13,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:08:13,862 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:13,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 20:08:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2024-10-11 20:08:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 221 states have (on average 1.0316742081447965) internal successors, (228), 221 states have internal predecessors, (228), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:08:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 232 transitions. [2024-10-11 20:08:13,873 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 232 transitions. Word has length 233 [2024-10-11 20:08:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:13,877 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 232 transitions. [2024-10-11 20:08:13,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 232 transitions. [2024-10-11 20:08:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 20:08:13,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:13,878 INFO L215 NwaCegarLoop]: trace histogram [63, 63, 63, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:13,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:08:13,879 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:08:13,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643350, now seen corresponding path program 1 times [2024-10-11 20:08:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:13,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624193874] [2024-10-11 20:08:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:08:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 20:08:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5965 trivial. 0 not checked. [2024-10-11 20:08:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624193874] [2024-10-11 20:08:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624193874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:14,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572167697] [2024-10-11 20:08:14,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:14,210 INFO L87 Difference]: Start difference. First operand 225 states and 232 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:14,242 INFO L93 Difference]: Finished difference Result 225 states and 232 transitions. [2024-10-11 20:08:14,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234 [2024-10-11 20:08:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:14,243 INFO L225 Difference]: With dead ends: 225 [2024-10-11 20:08:14,243 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:08:14,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:08:14,244 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:14,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:08:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:08:14,244 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:08:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:08:14,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2024-10-11 20:08:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:14,245 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:08:14,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:08:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:08:14,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:08:14,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location borErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 20:08:14,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location borErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 20:08:14,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 20:08:14,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 20:08:14,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 20:08:14,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 20:08:14,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 20:08:14,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 20:08:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:08:14,257 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:14,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:08:14,341 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:08:14,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:08:14 BoogieIcfgContainer [2024-10-11 20:08:14,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:08:14,355 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:08:14,355 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:08:14,355 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:08:14,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:08:00" (3/4) ... [2024-10-11 20:08:14,357 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:08:14,359 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bor [2024-10-11 20:08:14,362 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 20:08:14,363 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 20:08:14,363 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:08:14,363 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:08:14,363 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:08:14,438 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:08:14,439 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:08:14,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:08:14,440 INFO L158 Benchmark]: Toolchain (without parser) took 14885.68ms. Allocated memory was 136.3MB in the beginning and 327.2MB in the end (delta: 190.8MB). Free memory was 68.2MB in the beginning and 206.9MB in the end (delta: -138.7MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,441 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 136.3MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:08:14,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.65ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 68.0MB in the beginning and 157.0MB in the end (delta: -89.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.82ms. Allocated memory is still 188.7MB. Free memory was 157.0MB in the beginning and 155.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,441 INFO L158 Benchmark]: Boogie Preprocessor took 36.83ms. Allocated memory is still 188.7MB. Free memory was 155.9MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,441 INFO L158 Benchmark]: RCFGBuilder took 390.92ms. Allocated memory is still 188.7MB. Free memory was 153.9MB in the beginning and 137.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,442 INFO L158 Benchmark]: TraceAbstraction took 14083.18ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 136.0MB in the beginning and 212.1MB in the end (delta: -76.1MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,442 INFO L158 Benchmark]: Witness Printer took 84.77ms. Allocated memory is still 327.2MB. Free memory was 212.1MB in the beginning and 206.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:08:14,443 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.74ms. Allocated memory is still 136.3MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.65ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 68.0MB in the beginning and 157.0MB in the end (delta: -89.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.82ms. Allocated memory is still 188.7MB. Free memory was 157.0MB in the beginning and 155.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.83ms. Allocated memory is still 188.7MB. Free memory was 155.9MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.92ms. Allocated memory is still 188.7MB. Free memory was 153.9MB in the beginning and 137.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14083.18ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 136.0MB in the beginning and 212.1MB in the end (delta: -76.1MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 84.77ms. Allocated memory is still 327.2MB. Free memory was 212.1MB in the beginning and 206.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: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 17, TraceHistogramMax: 63, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 2053 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1589 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1143 IncrementalHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 464 mSDtfsCounter, 1143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 890 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6704 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=14, InterpolantAutomatonStates: 297, 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, 17 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1855 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2145 ConstructedInterpolants, 0 QuantifiedInterpolants, 3163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2132 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 31 InterpolantComputations, 12 PerfectInterpolantSequences, 23350/27478 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 8 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((1 < i) || (1 == i)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:08:14,478 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