/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:41:29,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:41:29,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:41:29,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:41:29,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:41:29,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:41:29,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:41:29,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:41:29,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:41:29,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:41:29,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:41:29,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:41:29,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:41:29,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:41:29,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:41:29,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:41:29,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:41:29,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:41:29,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:41:29,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:41:29,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:41:29,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:41:29,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:41:29,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:41:29,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:41:29,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:41:29,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:41:29,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:41:29,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:41:29,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:41:29,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:41:29,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:41:29,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:41:29,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:41:29,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:41:29,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:41:29,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:41:29,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:41:29,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:41:29,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:41:29,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:41:29,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:41:29,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:41:29,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:41:29,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:41:29,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:41:29,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:41:29,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:41:29,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:41:29,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:41:29,547 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:41:29,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:41:29,548 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:41:29,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:41:29,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:41:29,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:41:29,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:41:29,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:41:29,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:41:29,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:41:29,550 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:41:29,550 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:41:29,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:41:29,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:41:29,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:41:29,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:41:29,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:41:29,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:41:29,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:41:29,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:41:29,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:41:29,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:41:29,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:41:29,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:41:29,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:41:29,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:41:29,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:41:29,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:41:29,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:41:29,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:41:29,996 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:41:29,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested9.i [2022-10-15 21:41:30,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e39dd72/d1a25f9437484fbaa296161a4d1c513d/FLAG040a1396f [2022-10-15 21:41:30,638 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:41:30,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i [2022-10-15 21:41:30,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e39dd72/d1a25f9437484fbaa296161a4d1c513d/FLAG040a1396f [2022-10-15 21:41:31,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e39dd72/d1a25f9437484fbaa296161a4d1c513d [2022-10-15 21:41:31,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:41:31,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:41:31,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:41:31,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:41:31,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:41:31,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f66d61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31, skipping insertion in model container [2022-10-15 21:41:31,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:41:31,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:41:31,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i[893,906] [2022-10-15 21:41:31,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:41:31,255 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:41:31,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i[893,906] [2022-10-15 21:41:31,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:41:31,293 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:41:31,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31 WrapperNode [2022-10-15 21:41:31,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:41:31,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:41:31,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:41:31,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:41:31,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,337 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-10-15 21:41:31,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:41:31,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:41:31,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:41:31,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:41:31,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:41:31,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:41:31,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:41:31,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:41:31,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (1/1) ... [2022-10-15 21:41:31,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:41:31,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:31,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:41:31,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:41:31,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:41:31,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:41:31,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:41:31,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:41:31,529 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:41:31,532 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:41:31,784 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:41:31,800 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:41:31,800 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 21:41:31,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:41:31 BoogieIcfgContainer [2022-10-15 21:41:31,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:41:31,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:41:31,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:41:31,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:41:31,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:41:31" (1/3) ... [2022-10-15 21:41:31,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296b634b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:41:31, skipping insertion in model container [2022-10-15 21:41:31,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:31" (2/3) ... [2022-10-15 21:41:31,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296b634b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:41:31, skipping insertion in model container [2022-10-15 21:41:31,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:41:31" (3/3) ... [2022-10-15 21:41:31,826 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9.i [2022-10-15 21:41:31,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:41:31,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 21:41:31,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:41:31,956 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@73aa5824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:41:31,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 21:41:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 21:41:31,985 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:31,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 21:41:31,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 889571337, now seen corresponding path program 1 times [2022-10-15 21:41:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:32,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358844144] [2022-10-15 21:41:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:32,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358844144] [2022-10-15 21:41:32,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358844144] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:32,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:32,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:41:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209004356] [2022-10-15 21:41:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:32,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:41:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:41:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:41:32,266 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-10-15 21:41:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:32,364 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-10-15 21:41:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:41:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 [2022-10-15 21:41:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:32,380 INFO L225 Difference]: With dead ends: 99 [2022-10-15 21:41:32,380 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 21:41:32,384 INFO L412 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 [2022-10-15 21:41:32,391 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:32,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 21:41:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-15 21:41:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-10-15 21:41:32,456 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 6 [2022-10-15 21:41:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:32,457 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-10-15 21:41:32,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-10-15 21:41:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-10-15 21:41:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 21:41:32,458 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:32,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:32,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:41:32,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907722, now seen corresponding path program 1 times [2022-10-15 21:41:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:32,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994951375] [2022-10-15 21:41:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:32,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994951375] [2022-10-15 21:41:32,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994951375] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:32,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:32,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:41:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699256613] [2022-10-15 21:41:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:32,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:41:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:41:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:41:32,518 INFO L87 Difference]: Start difference. First operand 49 states and 51 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) [2022-10-15 21:41:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:32,540 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-10-15 21:41:32,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:41:32,541 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 [2022-10-15 21:41:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:32,543 INFO L225 Difference]: With dead ends: 49 [2022-10-15 21:41:32,543 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 21:41:32,543 INFO L412 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 [2022-10-15 21:41:32,545 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:32,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 21:41:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 21:41:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-10-15 21:41:32,556 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 7 [2022-10-15 21:41:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:32,556 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-10-15 21:41:32,557 INFO L496 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) [2022-10-15 21:41:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-10-15 21:41:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 21:41:32,557 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:32,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:32,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:41:32,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash 179564587, now seen corresponding path program 1 times [2022-10-15 21:41:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:32,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920166122] [2022-10-15 21:41:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:32,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920166122] [2022-10-15 21:41:32,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920166122] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:32,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:32,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:41:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103942303] [2022-10-15 21:41:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:32,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:41:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:41:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:32,677 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:32,716 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-10-15 21:41:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:41:32,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 21:41:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:32,718 INFO L225 Difference]: With dead ends: 47 [2022-10-15 21:41:32,718 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 21:41:32,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:41:32,721 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:32,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 21:41:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 21:41:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-10-15 21:41:32,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 8 [2022-10-15 21:41:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:32,732 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-10-15 21:41:32,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-10-15 21:41:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 21:41:32,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:32,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:32,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:41:32,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1271534956, now seen corresponding path program 1 times [2022-10-15 21:41:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200158958] [2022-10-15 21:41:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:32,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200158958] [2022-10-15 21:41:32,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200158958] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:32,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:32,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:41:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491745303] [2022-10-15 21:41:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:32,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:41:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:41:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:32,797 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:32,821 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-10-15 21:41:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:41:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 21:41:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:32,823 INFO L225 Difference]: With dead ends: 46 [2022-10-15 21:41:32,823 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 21:41:32,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:41:32,826 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:32,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 48 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 21:41:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 21:41:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-10-15 21:41:32,842 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 9 [2022-10-15 21:41:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:32,843 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-10-15 21:41:32,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-10-15 21:41:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 21:41:32,847 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:32,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:32,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:41:32,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2067476878, now seen corresponding path program 1 times [2022-10-15 21:41:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:32,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483428153] [2022-10-15 21:41:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:32,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483428153] [2022-10-15 21:41:32,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483428153] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:32,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:32,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:41:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772192916] [2022-10-15 21:41:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:32,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:41:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:41:32,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:41:32,983 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:33,038 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-10-15 21:41:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:41:33,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-10-15 21:41:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:33,040 INFO L225 Difference]: With dead ends: 79 [2022-10-15 21:41:33,040 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 21:41:33,040 INFO L412 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 [2022-10-15 21:41:33,042 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:33,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 21:41:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2022-10-15 21:41:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 63 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2022-10-15 21:41:33,058 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 13 [2022-10-15 21:41:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:33,058 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2022-10-15 21:41:33,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-10-15 21:41:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 21:41:33,059 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:33,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:33,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:41:33,060 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash 918465884, now seen corresponding path program 1 times [2022-10-15 21:41:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:33,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837917159] [2022-10-15 21:41:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837917159] [2022-10-15 21:41:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837917159] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:33,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:33,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:41:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280904372] [2022-10-15 21:41:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:33,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:41:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:41:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:33,175 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:33,275 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-10-15 21:41:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:41:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 21:41:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:33,278 INFO L225 Difference]: With dead ends: 75 [2022-10-15 21:41:33,278 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 21:41:33,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:41:33,283 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:33,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 21:41:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-10-15 21:41:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.4) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-10-15 21:41:33,298 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 19 [2022-10-15 21:41:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:33,298 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-10-15 21:41:33,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-10-15 21:41:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 21:41:33,299 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:33,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:33,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:41:33,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash 918466654, now seen corresponding path program 1 times [2022-10-15 21:41:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:33,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537116834] [2022-10-15 21:41:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:33,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537116834] [2022-10-15 21:41:33,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537116834] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:33,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:33,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:41:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478911817] [2022-10-15 21:41:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:33,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:41:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:41:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:33,394 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:33,480 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-10-15 21:41:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:41:33,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 21:41:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:33,489 INFO L225 Difference]: With dead ends: 98 [2022-10-15 21:41:33,489 INFO L226 Difference]: Without dead ends: 96 [2022-10-15 21:41:33,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:33,495 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:33,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 74 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-15 21:41:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2022-10-15 21:41:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.396551724137931) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-10-15 21:41:33,528 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 19 [2022-10-15 21:41:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:33,528 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-10-15 21:41:33,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-10-15 21:41:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 21:41:33,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:33,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:33,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:41:33,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1592305790, now seen corresponding path program 1 times [2022-10-15 21:41:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:33,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991230722] [2022-10-15 21:41:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:33,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:33,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991230722] [2022-10-15 21:41:33,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991230722] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:33,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:33,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:41:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347930192] [2022-10-15 21:41:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:33,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:41:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:41:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:41:33,632 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:33,733 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-10-15 21:41:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:41:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-10-15 21:41:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:33,736 INFO L225 Difference]: With dead ends: 76 [2022-10-15 21:41:33,736 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 21:41:33,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:41:33,740 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:33,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 21:41:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-10-15 21:41:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-10-15 21:41:33,762 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 20 [2022-10-15 21:41:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:33,763 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-10-15 21:41:33,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-10-15 21:41:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 21:41:33,766 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:33,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:41:33,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2116839108, now seen corresponding path program 1 times [2022-10-15 21:41:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:33,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226989617] [2022-10-15 21:41:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:33,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:33,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226989617] [2022-10-15 21:41:33,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226989617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:33,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:33,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:41:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281131149] [2022-10-15 21:41:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:33,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:41:33,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:33,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:41:33,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:33,850 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:33,881 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-10-15 21:41:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:41:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 21:41:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:33,883 INFO L225 Difference]: With dead ends: 110 [2022-10-15 21:41:33,883 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 21:41:33,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:41:33,886 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:33,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 21:41:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 21:41:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-10-15 21:41:33,901 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 21 [2022-10-15 21:41:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:33,901 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-10-15 21:41:33,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-10-15 21:41:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 21:41:33,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:33,902 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:33,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:41:33,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1219361556, now seen corresponding path program 1 times [2022-10-15 21:41:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:33,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002559837] [2022-10-15 21:41:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:33,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002559837] [2022-10-15 21:41:33,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002559837] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:33,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154633818] [2022-10-15 21:41:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:33,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:33,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:33,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:33,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:41:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:34,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:41:34,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:34,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:34,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154633818] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:34,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:34,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-10-15 21:41:34,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646413993] [2022-10-15 21:41:34,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:34,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 21:41:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 21:41:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:41:34,147 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:34,314 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-10-15 21:41:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:41:34,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 21:41:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:34,315 INFO L225 Difference]: With dead ends: 86 [2022-10-15 21:41:34,316 INFO L226 Difference]: Without dead ends: 83 [2022-10-15 21:41:34,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:41:34,317 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 97 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:34,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 139 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-15 21:41:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2022-10-15 21:41:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-10-15 21:41:34,328 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 22 [2022-10-15 21:41:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:34,329 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-10-15 21:41:34,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-10-15 21:41:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 21:41:34,330 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:34,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:34,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 21:41:34,546 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash 854497502, now seen corresponding path program 1 times [2022-10-15 21:41:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860215565] [2022-10-15 21:41:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:34,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860215565] [2022-10-15 21:41:34,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860215565] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:34,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752847125] [2022-10-15 21:41:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:34,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:34,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:34,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:41:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:34,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:41:34,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:34,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:41:34,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752847125] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:34,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:41:34,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-10-15 21:41:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091245268] [2022-10-15 21:41:34,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:41:34,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:34,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:41:34,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:41:34,724 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:34,781 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-10-15 21:41:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:41:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 21:41:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:34,783 INFO L225 Difference]: With dead ends: 71 [2022-10-15 21:41:34,783 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 21:41:34,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:41:34,784 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:34,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 60 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 21:41:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 21:41:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.278688524590164) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-10-15 21:41:34,795 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 23 [2022-10-15 21:41:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:34,795 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-10-15 21:41:34,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-10-15 21:41:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 21:41:34,796 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:34,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:34,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:35,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-15 21:41:35,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1371775832, now seen corresponding path program 1 times [2022-10-15 21:41:35,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:35,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859231449] [2022-10-15 21:41:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:41:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859231449] [2022-10-15 21:41:35,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859231449] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:35,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:35,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:41:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964483901] [2022-10-15 21:41:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:35,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:41:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:41:35,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:41:35,053 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:35,095 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2022-10-15 21:41:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:41:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-15 21:41:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:35,097 INFO L225 Difference]: With dead ends: 109 [2022-10-15 21:41:35,098 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 21:41:35,098 INFO L412 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 [2022-10-15 21:41:35,099 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:35,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 58 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 21:41:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2022-10-15 21:41:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-10-15 21:41:35,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2022-10-15 21:41:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:35,110 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-10-15 21:41:35,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-10-15 21:41:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:41:35,111 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:35,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:35,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:41:35,111 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -424622070, now seen corresponding path program 1 times [2022-10-15 21:41:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:35,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212918971] [2022-10-15 21:41:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:41:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212918971] [2022-10-15 21:41:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212918971] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:35,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:35,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:41:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761503129] [2022-10-15 21:41:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:35,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:41:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:41:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:41:35,149 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:35,187 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-10-15 21:41:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:41:35,188 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 21:41:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:35,189 INFO L225 Difference]: With dead ends: 109 [2022-10-15 21:41:35,189 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 21:41:35,190 INFO L412 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 [2022-10-15 21:41:35,190 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:35,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 21:41:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 74. [2022-10-15 21:41:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2022-10-15 21:41:35,200 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 29 [2022-10-15 21:41:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:35,200 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-10-15 21:41:35,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-10-15 21:41:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:41:35,201 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:35,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:41:35,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -424623160, now seen corresponding path program 1 times [2022-10-15 21:41:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:35,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175162945] [2022-10-15 21:41:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:35,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:35,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175162945] [2022-10-15 21:41:35,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175162945] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:35,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524702178] [2022-10-15 21:41:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:35,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:35,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:35,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:41:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:35,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:41:35,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:35,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:41:35,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524702178] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:35,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:41:35,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2022-10-15 21:41:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976318345] [2022-10-15 21:41:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:35,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:41:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:41:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:41:35,426 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:35,572 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2022-10-15 21:41:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:41:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 21:41:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:35,574 INFO L225 Difference]: With dead ends: 186 [2022-10-15 21:41:35,574 INFO L226 Difference]: Without dead ends: 135 [2022-10-15 21:41:35,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:41:35,576 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:35,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 91 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-10-15 21:41:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2022-10-15 21:41:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 81 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2022-10-15 21:41:35,591 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 29 [2022-10-15 21:41:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:35,592 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2022-10-15 21:41:35,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2022-10-15 21:41:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 21:41:35,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:35,596 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:35,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:35,797 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash -238920585, now seen corresponding path program 1 times [2022-10-15 21:41:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735687001] [2022-10-15 21:41:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-15 21:41:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:35,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735687001] [2022-10-15 21:41:35,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735687001] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:35,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979082403] [2022-10-15 21:41:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:35,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:35,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:35,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 21:41:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:35,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:41:35,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:35,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:41:35,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979082403] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:35,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:41:35,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2022-10-15 21:41:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839142191] [2022-10-15 21:41:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:35,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:41:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:41:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:41:35,989 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:36,085 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2022-10-15 21:41:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:41:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-15 21:41:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:36,086 INFO L225 Difference]: With dead ends: 155 [2022-10-15 21:41:36,086 INFO L226 Difference]: Without dead ends: 119 [2022-10-15 21:41:36,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:41:36,088 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 119 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:36,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 65 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-15 21:41:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2022-10-15 21:41:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 81 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2022-10-15 21:41:36,100 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 33 [2022-10-15 21:41:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:36,100 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2022-10-15 21:41:36,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2022-10-15 21:41:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:41:36,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:36,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:36,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:36,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 21:41:36,315 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1032957135, now seen corresponding path program 1 times [2022-10-15 21:41:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:36,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476355047] [2022-10-15 21:41:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:36,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476355047] [2022-10-15 21:41:36,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476355047] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:36,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251208454] [2022-10-15 21:41:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:36,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:36,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 21:41:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:36,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:41:36,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:36,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:36,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251208454] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:36,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:36,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-10-15 21:41:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770446558] [2022-10-15 21:41:36,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:36,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 21:41:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 21:41:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:41:36,594 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:37,033 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2022-10-15 21:41:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-15 21:41:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 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 35 [2022-10-15 21:41:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:37,035 INFO L225 Difference]: With dead ends: 167 [2022-10-15 21:41:37,035 INFO L226 Difference]: Without dead ends: 166 [2022-10-15 21:41:37,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2022-10-15 21:41:37,037 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 240 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:37,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 210 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:41:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-10-15 21:41:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2022-10-15 21:41:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 103 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2022-10-15 21:41:37,052 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 35 [2022-10-15 21:41:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:37,052 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2022-10-15 21:41:37,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2022-10-15 21:41:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 21:41:37,053 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:37,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:37,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:37,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 21:41:37,268 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1956899995, now seen corresponding path program 1 times [2022-10-15 21:41:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:37,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337428371] [2022-10-15 21:41:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:37,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337428371] [2022-10-15 21:41:37,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337428371] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:37,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245466890] [2022-10-15 21:41:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:37,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:37,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 21:41:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:41:37,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:37,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:41:37,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245466890] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:37,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:41:37,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-10-15 21:41:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368845042] [2022-10-15 21:41:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:41:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:41:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:41:37,440 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:37,549 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2022-10-15 21:41:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:41:37,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-15 21:41:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:37,551 INFO L225 Difference]: With dead ends: 104 [2022-10-15 21:41:37,551 INFO L226 Difference]: Without dead ends: 103 [2022-10-15 21:41:37,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:41:37,553 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:37,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 74 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-15 21:41:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-10-15 21:41:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-10-15 21:41:37,567 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 36 [2022-10-15 21:41:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:37,568 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-10-15 21:41:37,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-10-15 21:41:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:41:37,570 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:37,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:37,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:37,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 21:41:37,785 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:37,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash 614783463, now seen corresponding path program 1 times [2022-10-15 21:41:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:37,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797865835] [2022-10-15 21:41:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:37,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797865835] [2022-10-15 21:41:37,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797865835] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:37,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837880494] [2022-10-15 21:41:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:37,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:37,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 21:41:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:38,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 21:41:38,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:38,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:41:38,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837880494] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:38,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:38,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-10-15 21:41:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318334760] [2022-10-15 21:41:38,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:38,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 21:41:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 21:41:38,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:41:38,218 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:38,464 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2022-10-15 21:41:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:41:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 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 38 [2022-10-15 21:41:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:38,466 INFO L225 Difference]: With dead ends: 171 [2022-10-15 21:41:38,467 INFO L226 Difference]: Without dead ends: 95 [2022-10-15 21:41:38,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-10-15 21:41:38,468 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:38,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 215 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-15 21:41:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-10-15 21:41:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 84 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-10-15 21:41:38,482 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 38 [2022-10-15 21:41:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:38,482 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-10-15 21:41:38,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-10-15 21:41:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 21:41:38,483 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:38,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:38,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:38,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:38,698 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1878417177, now seen corresponding path program 1 times [2022-10-15 21:41:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:38,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799355396] [2022-10-15 21:41:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:41:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:38,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799355396] [2022-10-15 21:41:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799355396] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637628581] [2022-10-15 21:41:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:38,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:38,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:38,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 21:41:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:38,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:41:38,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:41:38,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:41:38,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637628581] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:38,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:38,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-10-15 21:41:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970620168] [2022-10-15 21:41:38,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:38,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 21:41:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:38,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 21:41:38,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:41:38,946 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:39,204 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-10-15 21:41:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 21:41:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-15 21:41:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:39,206 INFO L225 Difference]: With dead ends: 119 [2022-10-15 21:41:39,206 INFO L226 Difference]: Without dead ends: 118 [2022-10-15 21:41:39,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-10-15 21:41:39,208 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:39,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 139 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-15 21:41:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2022-10-15 21:41:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-10-15 21:41:39,221 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 39 [2022-10-15 21:41:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:39,221 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-10-15 21:41:39,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-10-15 21:41:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 21:41:39,222 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:39,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:39,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:39,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:39,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1898609531, now seen corresponding path program 1 times [2022-10-15 21:41:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:39,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349272248] [2022-10-15 21:41:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:41:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:39,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349272248] [2022-10-15 21:41:39,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349272248] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:39,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810383594] [2022-10-15 21:41:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:39,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:39,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 21:41:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:39,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:41:39,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:41:39,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:41:39,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810383594] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:39,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:39,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-10-15 21:41:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289516227] [2022-10-15 21:41:39,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 21:41:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 21:41:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:41:39,717 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:39,876 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-10-15 21:41:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:41:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-10-15 21:41:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:39,878 INFO L225 Difference]: With dead ends: 105 [2022-10-15 21:41:39,878 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 21:41:39,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-10-15 21:41:39,880 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:39,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 129 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 21:41:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-10-15 21:41:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-10-15 21:41:39,898 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 40 [2022-10-15 21:41:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:39,898 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-10-15 21:41:39,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-10-15 21:41:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 21:41:39,899 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:39,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:39,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:40,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:40,116 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:40,116 INFO L85 PathProgramCache]: Analyzing trace with hash 930095966, now seen corresponding path program 1 times [2022-10-15 21:41:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:40,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637770306] [2022-10-15 21:41:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:41:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:40,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637770306] [2022-10-15 21:41:40,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637770306] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446855627] [2022-10-15 21:41:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:40,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:40,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:40,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 21:41:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:40,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:41:40,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 21:41:40,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 21:41:40,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446855627] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:40,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:40,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 13 [2022-10-15 21:41:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233779428] [2022-10-15 21:41:40,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:40,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 21:41:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 21:41:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:41:40,374 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 14 states, 13 states have (on average 9.461538461538462) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:40,525 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-10-15 21:41:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:41:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.461538461538462) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-10-15 21:41:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:40,527 INFO L225 Difference]: With dead ends: 166 [2022-10-15 21:41:40,527 INFO L226 Difference]: Without dead ends: 165 [2022-10-15 21:41:40,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2022-10-15 21:41:40,528 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 187 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:40,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 99 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-10-15 21:41:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2022-10-15 21:41:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-10-15 21:41:40,541 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 50 [2022-10-15 21:41:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:40,542 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-10-15 21:41:40,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.461538461538462) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-10-15 21:41:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-15 21:41:40,543 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:40,543 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:40,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-10-15 21:41:40,756 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash -806738092, now seen corresponding path program 1 times [2022-10-15 21:41:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191544565] [2022-10-15 21:41:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:41:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191544565] [2022-10-15 21:41:40,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191544565] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:40,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475847315] [2022-10-15 21:41:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:40,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:40,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:40,888 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:40,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 21:41:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:40,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:41:40,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 21:41:40,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 21:41:41,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475847315] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:41,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:41,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 13 [2022-10-15 21:41:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734524657] [2022-10-15 21:41:41,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:41,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 21:41:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 21:41:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:41:41,020 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 14 states, 13 states have (on average 8.615384615384615) internal successors, (112), 14 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:41,583 INFO L93 Difference]: Finished difference Result 287 states and 324 transitions. [2022-10-15 21:41:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-15 21:41:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.615384615384615) internal successors, (112), 14 states have internal predecessors, (112), 0 states have call successors, (0), 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 64 [2022-10-15 21:41:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:41,586 INFO L225 Difference]: With dead ends: 287 [2022-10-15 21:41:41,586 INFO L226 Difference]: Without dead ends: 286 [2022-10-15 21:41:41,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=1152, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 21:41:41,588 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 326 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:41,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 194 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:41:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-10-15 21:41:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 157. [2022-10-15 21:41:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 156 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2022-10-15 21:41:41,623 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 64 [2022-10-15 21:41:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:41,623 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2022-10-15 21:41:41,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.615384615384615) internal successors, (112), 14 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2022-10-15 21:41:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 21:41:41,624 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:41,624 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:41,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-15 21:41:41,840 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 760923022, now seen corresponding path program 1 times [2022-10-15 21:41:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:41,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029751144] [2022-10-15 21:41:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 21:41:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:41,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029751144] [2022-10-15 21:41:41,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029751144] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:41:41,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:41:41,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:41:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777135134] [2022-10-15 21:41:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:41:41,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:41:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:41,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:41:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:41:41,910 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:41,987 INFO L93 Difference]: Finished difference Result 177 states and 199 transitions. [2022-10-15 21:41:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:41:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-10-15 21:41:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:41,989 INFO L225 Difference]: With dead ends: 177 [2022-10-15 21:41:41,989 INFO L226 Difference]: Without dead ends: 176 [2022-10-15 21:41:41,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:41:41,990 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:41,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 84 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:41:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-10-15 21:41:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 156. [2022-10-15 21:41:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 155 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-10-15 21:41:42,011 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 65 [2022-10-15 21:41:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:42,011 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-10-15 21:41:42,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-10-15 21:41:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-15 21:41:42,012 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:42,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:42,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-15 21:41:42,013 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1457087563, now seen corresponding path program 1 times [2022-10-15 21:41:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320289332] [2022-10-15 21:41:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:41:42,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:42,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320289332] [2022-10-15 21:41:42,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320289332] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:42,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671689543] [2022-10-15 21:41:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:42,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:42,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:42,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 21:41:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:42,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 21:41:42,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 21:41:42,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 21:41:42,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671689543] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:42,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:42,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2022-10-15 21:41:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662858554] [2022-10-15 21:41:42,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:42,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-15 21:41:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-15 21:41:42,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-10-15 21:41:42,470 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 23 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:43,337 INFO L93 Difference]: Finished difference Result 328 states and 360 transitions. [2022-10-15 21:41:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-10-15 21:41:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 23 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-10-15 21:41:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:43,339 INFO L225 Difference]: With dead ends: 328 [2022-10-15 21:41:43,340 INFO L226 Difference]: Without dead ends: 327 [2022-10-15 21:41:43,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=884, Invalid=3538, Unknown=0, NotChecked=0, Total=4422 [2022-10-15 21:41:43,343 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 506 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:43,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 256 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:41:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-10-15 21:41:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 205. [2022-10-15 21:41:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 202 states have (on average 1.1287128712871286) internal successors, (228), 204 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2022-10-15 21:41:43,371 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 71 [2022-10-15 21:41:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:43,372 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2022-10-15 21:41:43,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 23 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2022-10-15 21:41:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-15 21:41:43,373 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:43,373 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:43,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-10-15 21:41:43,587 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:43,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1702340252, now seen corresponding path program 1 times [2022-10-15 21:41:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507175193] [2022-10-15 21:41:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-10-15 21:41:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507175193] [2022-10-15 21:41:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507175193] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:43,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641919677] [2022-10-15 21:41:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:43,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:43,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:43,682 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:43,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 21:41:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:43,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 21:41:43,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:41:43,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 39 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:41:44,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641919677] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:44,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:44,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 18 [2022-10-15 21:41:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118804167] [2022-10-15 21:41:44,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:44,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 21:41:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 21:41:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-10-15 21:41:44,085 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:44,618 INFO L93 Difference]: Finished difference Result 416 states and 461 transitions. [2022-10-15 21:41:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-15 21:41:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 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 72 [2022-10-15 21:41:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:44,620 INFO L225 Difference]: With dead ends: 416 [2022-10-15 21:41:44,620 INFO L226 Difference]: Without dead ends: 227 [2022-10-15 21:41:44,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 129 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2022-10-15 21:41:44,625 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 244 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:44,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 196 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:41:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-10-15 21:41:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 214. [2022-10-15 21:41:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 211 states have (on average 1.0900473933649288) internal successors, (230), 213 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2022-10-15 21:41:44,664 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 72 [2022-10-15 21:41:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:44,665 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2022-10-15 21:41:44,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2022-10-15 21:41:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-15 21:41:44,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:44,668 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:44,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:44,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-10-15 21:41:44,882 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -10778355, now seen corresponding path program 2 times [2022-10-15 21:41:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980017055] [2022-10-15 21:41:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 21:41:45,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:45,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980017055] [2022-10-15 21:41:45,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980017055] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:45,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375889151] [2022-10-15 21:41:45,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:41:45,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:45,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:45,062 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:45,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 21:41:45,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 21:41:45,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:41:45,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:41:45,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:41:45,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:41:45,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375889151] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:45,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:45,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-10-15 21:41:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353540479] [2022-10-15 21:41:45,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:45,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 21:41:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 21:41:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-10-15 21:41:45,457 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand has 21 states, 20 states have (on average 10.5) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:45,890 INFO L93 Difference]: Finished difference Result 222 states and 236 transitions. [2022-10-15 21:41:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-15 21:41:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.5) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-10-15 21:41:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:45,894 INFO L225 Difference]: With dead ends: 222 [2022-10-15 21:41:45,894 INFO L226 Difference]: Without dead ends: 221 [2022-10-15 21:41:45,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=411, Invalid=1071, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 21:41:45,896 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 374 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:45,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 107 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:41:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-15 21:41:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 177. [2022-10-15 21:41:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.0742857142857143) internal successors, (188), 176 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2022-10-15 21:41:45,940 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 102 [2022-10-15 21:41:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:45,941 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2022-10-15 21:41:45,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.5) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2022-10-15 21:41:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-10-15 21:41:45,942 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:45,943 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:45,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:46,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:46,157 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2028785086, now seen corresponding path program 2 times [2022-10-15 21:41:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:46,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489009471] [2022-10-15 21:41:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 39 proven. 167 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:41:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489009471] [2022-10-15 21:41:46,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489009471] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:46,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059334289] [2022-10-15 21:41:46,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:41:46,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:46,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:46,480 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:46,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-15 21:41:46,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 21:41:46,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:41:46,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:41:46,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 68 proven. 88 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-15 21:41:46,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-15 21:41:47,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059334289] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:47,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:47,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 29 [2022-10-15 21:41:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320143861] [2022-10-15 21:41:47,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:47,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-15 21:41:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-15 21:41:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2022-10-15 21:41:47,043 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand has 29 states, 29 states have (on average 7.896551724137931) internal successors, (229), 29 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:48,683 INFO L93 Difference]: Finished difference Result 355 states and 380 transitions. [2022-10-15 21:41:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-10-15 21:41:48,684 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.896551724137931) internal successors, (229), 29 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-10-15 21:41:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:48,686 INFO L225 Difference]: With dead ends: 355 [2022-10-15 21:41:48,686 INFO L226 Difference]: Without dead ends: 241 [2022-10-15 21:41:48,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1330, Invalid=3926, Unknown=0, NotChecked=0, Total=5256 [2022-10-15 21:41:48,689 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 361 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:48,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 98 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:41:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-10-15 21:41:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2022-10-15 21:41:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.0429184549356223) internal successors, (243), 233 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2022-10-15 21:41:48,732 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 111 [2022-10-15 21:41:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:48,732 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2022-10-15 21:41:48,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.896551724137931) internal successors, (229), 29 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2022-10-15 21:41:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-10-15 21:41:48,736 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:41:48,736 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:41:48,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:48,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-15 21:41:48,951 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:41:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:41:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash -237470542, now seen corresponding path program 2 times [2022-10-15 21:41:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:41:48,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135261404] [2022-10-15 21:41:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:41:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:41:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:41:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 216 proven. 63 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-10-15 21:41:49,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:41:49,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135261404] [2022-10-15 21:41:49,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135261404] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:41:49,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218789573] [2022-10-15 21:41:49,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:41:49,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:41:49,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:49,225 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:41:49,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-15 21:41:49,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 21:41:49,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:41:49,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 21:41:49,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:41:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-10-15 21:41:49,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:41:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-10-15 21:41:49,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218789573] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:41:49,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:41:49,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2022-10-15 21:41:49,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656920724] [2022-10-15 21:41:49,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:41:49,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 21:41:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:41:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 21:41:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2022-10-15 21:41:49,783 INFO L87 Difference]: Start difference. First operand 234 states and 243 transitions. Second operand has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 24 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:41:50,692 INFO L93 Difference]: Finished difference Result 313 states and 328 transitions. [2022-10-15 21:41:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-15 21:41:50,693 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 24 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-10-15 21:41:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:41:50,694 INFO L225 Difference]: With dead ends: 313 [2022-10-15 21:41:50,694 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:41:50,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=1634, Unknown=0, NotChecked=0, Total=2162 [2022-10-15 21:41:50,696 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 235 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:41:50,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 107 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:41:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:41:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:41:50,697 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) [2022-10-15 21:41:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:41:50,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2022-10-15 21:41:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:41:50,697 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:41:50,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 24 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:41:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:41:50,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:41:50,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-10-15 21:41:50,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-10-15 21:41:50,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-10-15 21:41:50,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-10-15 21:41:50,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-10-15 21:41:50,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-10-15 21:41:50,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-10-15 21:41:50,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-10-15 21:41:50,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-10-15 21:41:50,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-10-15 21:41:50,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-10-15 21:41:50,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-10-15 21:41:50,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-10-15 21:41:50,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-10-15 21:41:50,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-10-15 21:41:50,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-10-15 21:41:50,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-10-15 21:41:50,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-10-15 21:41:50,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-15 21:41:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-15 21:41:50,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:42:06,821 WARN L233 SmtUtils]: Spent 13.00s on a formula simplification. DAG size of input: 171 DAG size of output: 169 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-15 21:42:09,519 INFO L899 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,520 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,520 INFO L899 garLoopResultBuilder]: For program point L35-4(lines 35 37) no Hoare annotation was computed. [2022-10-15 21:42:09,520 INFO L899 garLoopResultBuilder]: For program point L35-6(lines 35 37) no Hoare annotation was computed. [2022-10-15 21:42:09,520 INFO L899 garLoopResultBuilder]: For program point L35-7(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,520 INFO L899 garLoopResultBuilder]: For program point L35-8(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,521 INFO L895 garLoopResultBuilder]: At program point L35-9(lines 35 37) the Hoare annotation is: (let ((.cse16 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (<= .cse16 |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= |ULTIMATE.start_main_~j~0#1| .cse16)) (.cse9 (< |ULTIMATE.start_main_~k~0#1| 2147483647)) (.cse10 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~i~0#1| 666665)) (.cse8 (<= (+ |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~m~0#1|) 1999998)) (.cse13 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (< |ULTIMATE.start_main_~l~0#1| 1000000)) (.cse3 (<= 0 (+ 999999 |ULTIMATE.start_main_~n~0#1|))) (.cse14 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse4 (<= 0 (+ 1999998 |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~m~0#1|))) (.cse5 (<= 0 (+ 999999 |ULTIMATE.start_main_~m~0#1|))) (.cse6 (<= (* 3 |ULTIMATE.start_main_~n~0#1|) 1999998)) (.cse12 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (.cse15 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (< |ULTIMATE.start_main_~m~0#1| 1000000))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse12 .cse7) (and .cse8 .cse9 (< |ULTIMATE.start_main_~j~0#1| 2147483647) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse1 .cse3 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse8 .cse13 .cse1 .cse3 .cse14 .cse4 (<= |ULTIMATE.start_main_~j~0#1| 2) .cse5 .cse6 .cse15 .cse7) (and .cse8 .cse13 .cse1 .cse3 .cse14 (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) .cse4 .cse5 .cse6 .cse12 (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse15 .cse7)))) [2022-10-15 21:42:09,522 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-10-15 21:42:09,522 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,522 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,522 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2022-10-15 21:42:09,523 INFO L899 garLoopResultBuilder]: For program point L36-3(line 36) no Hoare annotation was computed. [2022-10-15 21:42:09,523 INFO L899 garLoopResultBuilder]: For program point L36-4(line 36) no Hoare annotation was computed. [2022-10-15 21:42:09,523 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,524 INFO L895 garLoopResultBuilder]: At program point L36-5(lines 36 37) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (< |ULTIMATE.start_main_~l~0#1| 1000000)) (.cse1 (<= 0 (+ 999999 |ULTIMATE.start_main_~n~0#1|))) (.cse6 (* 3 |ULTIMATE.start_main_~i~0#1|)) (.cse2 (<= 0 (+ 1999998 |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~m~0#1|))) (.cse3 (<= 0 (+ 999999 |ULTIMATE.start_main_~m~0#1|))) (.cse9 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (<= |ULTIMATE.start_main_~i~0#1| 666665)) (.cse4 (<= (* 3 |ULTIMATE.start_main_~n~0#1|) 1999998)) (.cse8 (< |ULTIMATE.start_main_~m~0#1| 1000000))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~m~0#1| 999999) .cse2 (<= |ULTIMATE.start_main_~j~0#1| 2) .cse3 (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) .cse4 (<= 1 |ULTIMATE.start_main_~k~0#1|) .cse5 (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|)) (and .cse0 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) .cse6) (<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse1 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~k~0#1| .cse9) .cse5 .cse8) (and (< |ULTIMATE.start_main_~k~0#1| 2147483647) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse0 .cse1 (< |ULTIMATE.start_main_~j~0#1| .cse6) .cse2 .cse3 (<= .cse9 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse4 .cse8))) [2022-10-15 21:42:09,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:42:09,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:42:09,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-10-15 21:42:09,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,524 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L899 garLoopResultBuilder]: For program point L37-2(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L899 garLoopResultBuilder]: For program point L37-3(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,525 INFO L895 garLoopResultBuilder]: At program point L38(lines 25 40) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 999999) [2022-10-15 21:42:09,526 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-10-15 21:42:09,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,526 INFO L902 garLoopResultBuilder]: At program point L39(lines 25 40) the Hoare annotation is: true [2022-10-15 21:42:09,526 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-10-15 21:42:09,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-10-15 21:42:09,526 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-10-15 21:42:09,526 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point L33-2(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,527 INFO L899 garLoopResultBuilder]: For program point L33-4(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,528 INFO L899 garLoopResultBuilder]: For program point L33-5(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-10-15 21:42:09,528 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 37) no Hoare annotation was computed. [2022-10-15 21:42:09,528 INFO L899 garLoopResultBuilder]: For program point L34-3(line 34) no Hoare annotation was computed. [2022-10-15 21:42:09,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-10-15 21:42:09,529 INFO L899 garLoopResultBuilder]: For program point L34-4(line 34) no Hoare annotation was computed. [2022-10-15 21:42:09,529 INFO L895 garLoopResultBuilder]: At program point L34-5(lines 34 37) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~l~0#1| 1000000)) (.cse1 (<= 0 (+ 999999 |ULTIMATE.start_main_~n~0#1|))) (.cse2 (<= |ULTIMATE.start_main_~m~0#1| 999999)) (.cse3 (<= 0 (+ 1999998 |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~m~0#1|))) (.cse4 (<= 0 (+ 999999 |ULTIMATE.start_main_~m~0#1|))) (.cse5 (<= (* 3 |ULTIMATE.start_main_~n~0#1|) 1999998))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (< |ULTIMATE.start_main_~k~0#1| 2147483647) (< |ULTIMATE.start_main_~j~0#1| 2147483647) .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~j~0#1|) .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~i~0#1| 715827882) (< |ULTIMATE.start_main_~m~0#1| 1000000)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse0 (< 0 (+ 2147483650 |ULTIMATE.start_main_~j~0#1|)) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| 2) .cse4 .cse5 (<= |ULTIMATE.start_main_~i~0#1| 1)))) [2022-10-15 21:42:09,529 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-10-15 21:42:09,529 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~m~0#1|) 1999998)) (.cse1 (< |ULTIMATE.start_main_~i~0#1| 1073741823)) (.cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (* 3 |ULTIMATE.start_main_~i~0#1|))) (.cse5 (<= |ULTIMATE.start_main_~n~0#1| 999999)) (.cse9 (<= |ULTIMATE.start_main_~i~0#1| 666665)) (.cse3 (< |ULTIMATE.start_main_~l~0#1| 1000000)) (.cse6 (<= 0 (+ 999999 |ULTIMATE.start_main_~n~0#1|))) (.cse7 (<= 0 (+ 1999998 |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~m~0#1|))) (.cse8 (<= 0 (+ 999999 |ULTIMATE.start_main_~m~0#1|))) (.cse10 (<= (* 3 |ULTIMATE.start_main_~n~0#1|) 1999998)) (.cse12 (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|)) (.cse11 (< |ULTIMATE.start_main_~m~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|) .cse9 .cse10 .cse12 .cse11) (and .cse3 .cse6 .cse7 (<= |ULTIMATE.start_main_~j~0#1| 2) .cse8 (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) .cse10 (<= 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse12 .cse11))) [2022-10-15 21:42:09,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,530 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,530 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-10-15 21:42:09,534 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:09,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:42:09,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:42:09 BoogieIcfgContainer [2022-10-15 21:42:09,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:42:09,565 INFO L158 Benchmark]: Toolchain (without parser) took 38521.52ms. Allocated memory was 156.2MB in the beginning and 270.5MB in the end (delta: 114.3MB). Free memory was 129.1MB in the beginning and 162.2MB in the end (delta: -33.1MB). Peak memory consumption was 159.7MB. Max. memory is 8.0GB. [2022-10-15 21:42:09,565 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 156.2MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:42:09,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.71ms. Allocated memory is still 156.2MB. Free memory was 128.6MB in the beginning and 118.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 21:42:09,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.94ms. Allocated memory is still 156.2MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 21:42:09,566 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 156.2MB. Free memory was 117.1MB in the beginning and 116.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 21:42:09,566 INFO L158 Benchmark]: RCFGBuilder took 440.87ms. Allocated memory is still 156.2MB. Free memory was 116.0MB in the beginning and 102.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 21:42:09,567 INFO L158 Benchmark]: TraceAbstraction took 37755.59ms. Allocated memory was 156.2MB in the beginning and 270.5MB in the end (delta: 114.3MB). Free memory was 102.2MB in the beginning and 162.2MB in the end (delta: -60.0MB). Peak memory consumption was 133.5MB. Max. memory is 8.0GB. [2022-10-15 21:42:09,569 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 156.2MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.71ms. Allocated memory is still 156.2MB. Free memory was 128.6MB in the beginning and 118.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.94ms. Allocated memory is still 156.2MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 156.2MB. Free memory was 117.1MB in the beginning and 116.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 440.87ms. Allocated memory is still 156.2MB. Free memory was 116.0MB in the beginning and 102.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 37755.59ms. Allocated memory was 156.2MB in the beginning and 270.5MB in the end (delta: 114.3MB). Free memory was 102.2MB in the beginning and 162.2MB in the end (delta: -60.0MB). Peak memory consumption was 133.5MB. Max. memory is 8.0GB. * 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 37.6s, OverallIterations: 28, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3720 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3720 mSDsluCounter, 2984 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2206 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4841 IncrementalHoareTripleChecker+Invalid, 5228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 778 mSDtfsCounter, 4841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2081 GetRequests, 1580 SyntacticMatches, 14 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=27, InterpolantAutomatonStates: 368, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 702 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 52 NumberOfFragments, 719 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4091 FormulaSimplificationTreeSizeReduction, 15.9s HoareSimplificationTime, 6 FomulaSimplificationsInter, 413932 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2062 NumberOfCodeBlocks, 1770 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2794 ConstructedInterpolants, 0 QuantifiedInterpolants, 8466 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1375 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 56 InterpolantComputations, 16 PerfectInterpolantSequences, 1366/3182 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 18 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((i == 0 && l < 1000000) && 0 <= 999999 + n) && m <= 999999) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && 3 * n <= 1999998) || (((((((((((k < 2147483647 && j < 2147483647) && l < 1000000) && 0 <= 999999 + n) && 2 <= j) && 0 <= 1999998 + l + m) && 2 <= i) && 0 <= 999999 + m) && 3 * n <= 1999998) && 1 <= k) && i < 715827882) && m < 1000000)) || (((((((((1 <= i && l < 1000000) && 0 < 2147483650 + j) && 0 <= 999999 + n) && m <= 999999) && 0 <= 1999998 + l + m) && j <= 2) && 0 <= 999999 + m) && 3 * n <= 1999998) && i <= 1) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((l + m <= 1999998 && i < 1073741823) && 1 <= i) && l < 1000000) && j + 1 <= 3 * i) && 2 + k <= j) && n <= 999999) && 0 <= 999999 + n) && i <= k) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && i <= 666665) && 3 * n <= 1999998) && m < 1000000) || (((((((((((((l + m <= 1999998 && i < 1073741823) && 1 <= i) && l < 1000000) && j + 1 <= 3 * i) && n <= 999999) && 0 <= 999999 + n) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && i + 1 <= k) && i <= 666665) && 3 * n <= 1999998) && k < j) && m < 1000000)) || ((((((((((l < 1000000 && 0 <= 999999 + n) && 0 <= 1999998 + l + m) && j <= 2) && 0 <= 999999 + m) && k <= i) && 3 * n <= 1999998) && 1 <= k) && i <= 1) && k < j) && m < 1000000) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((l < 1000000 && 0 <= 999999 + n) && m <= 999999) && 0 <= 1999998 + l + m) && j <= 2) && 0 <= 999999 + m) && k <= i) && 3 * n <= 1999998) && 1 <= k) && i <= 1) && k < j) || (((((((((l < 1000000 && j + 1 <= 3 * i) && 2 + k <= j) && 0 <= 999999 + n) && i <= k) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && i <= 666665) && 3 * n <= 1999998) && m < 1000000)) || (((((((((l < 1000000 && 0 <= 999999 + n) && 2 <= j) && j <= k) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && 3 * n <= 1999998) && k <= i + 1) && i <= 1) && m < 1000000)) || ((((((((((k < 2147483647 && 2 + i <= j) && l < 1000000) && 0 <= 999999 + n) && j < 3 * i) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && i + 1 <= k) && i <= 666665) && 3 * n <= 1999998) && m < 1000000) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: n <= 999999 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((((i == 0 && 2 * i <= j) && l < 1000000) && j <= 2 * i) && 0 <= 999999 + n) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && 3 * n <= 1999998) && m < 1000000) || ((((((((((((l + m <= 1999998 && k < 2147483647) && 2 * i <= j) && l < 1000000) && j <= 2 * i) && 0 <= 999999 + n) && 0 <= 1999998 + l + m) && 2 <= i) && 0 <= 999999 + m) && i <= 666665) && 3 * n <= 1999998) && 1 <= k) && m < 1000000)) || ((((((((((((l + m <= 1999998 && k < 2147483647) && j < 2147483647) && 2 + i <= j) && l < 1000000) && 0 <= 999999 + n) && i <= k) && 0 <= 1999998 + l + m) && 2 <= i) && 0 <= 999999 + m) && i <= 666665) && 3 * n <= 1999998) && m < 1000000)) || ((((((((((l + m <= 1999998 && 1 <= i) && l < 1000000) && 0 <= 999999 + n) && 2 <= j) && 0 <= 1999998 + l + m) && j <= 2) && 0 <= 999999 + m) && 3 * n <= 1999998) && i <= 1) && m < 1000000)) || ((((((((((((l + m <= 1999998 && 1 <= i) && l < 1000000) && 0 <= 999999 + n) && 2 <= j) && j <= 3 + i) && 0 <= 1999998 + l + m) && 0 <= 999999 + m) && 3 * n <= 1999998) && 1 <= k) && k <= i + 1) && i <= 1) && m < 1000000) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-10-15 21:42:09,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...