/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/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:27:59,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:27:59,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:27:59,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:27:59,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:27:59,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:27:59,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:27:59,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:27:59,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:27:59,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:27:59,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:27:59,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:27:59,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:27:59,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:27:59,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:27:59,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:27:59,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:27:59,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:27:59,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:27:59,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:27:59,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:27:59,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:27:59,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:27:59,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:27:59,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:27:59,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:27:59,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:27:59,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:27:59,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:27:59,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:27:59,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:27:59,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:27:59,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:27:59,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:27:59,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:27:59,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:27:59,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:27:59,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:27:59,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:27:59,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:27:59,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:27:59,567 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-16 17:27:59,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:27:59,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:27:59,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:27:59,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:27:59,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:27:59,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:27:59,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:27:59,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:27:59,621 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:27:59,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:27:59,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:27:59,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:27:59,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:27:59,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:27:59,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:27:59,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:27:59,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:27:59,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:27:59,624 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:27:59,624 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:27:59,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:27:59,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:27:59,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:27:59,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:27:59,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:27:59,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:27:59,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:27:59,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:27:59,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:27:59,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:27:59,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:27:59,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:27:59,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:27:59,627 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-16 17:28:00,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:28:00,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:28:00,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:28:00,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:28:00,040 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:28:00,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-10-16 17:28:00,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67c699d5/65f7d2d49db146158b1a191537ae1585/FLAG7dec3df2f [2022-10-16 17:28:00,686 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:28:00,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-10-16 17:28:00,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67c699d5/65f7d2d49db146158b1a191537ae1585/FLAG7dec3df2f [2022-10-16 17:28:01,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67c699d5/65f7d2d49db146158b1a191537ae1585 [2022-10-16 17:28:01,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:28:01,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:28:01,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:28:01,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:28:01,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:28:01,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1347ffb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01, skipping insertion in model container [2022-10-16 17:28:01,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:28:01,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:28:01,278 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-10-16 17:28:01,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:28:01,309 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:28:01,322 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-10-16 17:28:01,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:28:01,352 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:28:01,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01 WrapperNode [2022-10-16 17:28:01,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:28:01,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:28:01,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:28:01,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:28:01,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,390 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-10-16 17:28:01,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:28:01,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:28:01,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:28:01,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:28:01,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:28:01,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:28:01,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:28:01,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:28:01,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (1/1) ... [2022-10-16 17:28:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:28:01,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:01,470 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-16 17:28:01,485 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-16 17:28:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 17:28:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 17:28:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 17:28:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 17:28:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-10-16 17:28:01,538 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-10-16 17:28:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 17:28:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:28:01,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:28:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 17:28:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-10-16 17:28:01,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-10-16 17:28:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 17:28:01,632 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:28:01,634 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:28:01,981 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:28:01,989 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:28:01,989 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 17:28:01,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:28:01 BoogieIcfgContainer [2022-10-16 17:28:01,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:28:01,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:28:01,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:28:01,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:28:01,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:28:01" (1/3) ... [2022-10-16 17:28:01,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b456c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:28:01, skipping insertion in model container [2022-10-16 17:28:01,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:28:01" (2/3) ... [2022-10-16 17:28:01,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b456c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:28:01, skipping insertion in model container [2022-10-16 17:28:02,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:28:01" (3/3) ... [2022-10-16 17:28:02,001 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-10-16 17:28:02,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:28:02,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-16 17:28:02,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:28:02,121 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;@387ef75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:28:02,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-16 17:28:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 17:28:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 17:28:02,136 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:02,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:02,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1346921732, now seen corresponding path program 1 times [2022-10-16 17:28:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:02,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005713208] [2022-10-16 17:28:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 17:28:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:02,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005713208] [2022-10-16 17:28:02,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005713208] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:28:02,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:28:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 17:28:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163636355] [2022-10-16 17:28:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:28:02,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 17:28:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 17:28:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 17:28:02,400 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 17:28:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:02,428 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-10-16 17:28:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 17:28:02,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-10-16 17:28:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:02,438 INFO L225 Difference]: With dead ends: 89 [2022-10-16 17:28:02,438 INFO L226 Difference]: Without dead ends: 35 [2022-10-16 17:28:02,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 17:28:02,447 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:02,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:28:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-16 17:28:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-16 17:28:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 17:28:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-10-16 17:28:02,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2022-10-16 17:28:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:02,488 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-10-16 17:28:02,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 17:28:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-10-16 17:28:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 17:28:02,490 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:02,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:02,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:28:02,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1031497992, now seen corresponding path program 1 times [2022-10-16 17:28:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:02,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151888321] [2022-10-16 17:28:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 17:28:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:02,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151888321] [2022-10-16 17:28:02,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151888321] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:28:02,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:28:02,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 17:28:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240220636] [2022-10-16 17:28:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:28:02,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:28:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:28:02,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 17:28:02,629 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-16 17:28:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:02,657 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-10-16 17:28:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:28:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-10-16 17:28:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:02,659 INFO L225 Difference]: With dead ends: 35 [2022-10-16 17:28:02,659 INFO L226 Difference]: Without dead ends: 34 [2022-10-16 17:28:02,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 17:28:02,662 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 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-16 17:28:02,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:28:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-16 17:28:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-16 17:28:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 17:28:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-10-16 17:28:02,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 16 [2022-10-16 17:28:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:02,673 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-10-16 17:28:02,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-16 17:28:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-10-16 17:28:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 17:28:02,674 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:02,675 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:02,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:28:02,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1911666638, now seen corresponding path program 1 times [2022-10-16 17:28:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:02,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524591096] [2022-10-16 17:28:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 17:28:02,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524591096] [2022-10-16 17:28:02,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524591096] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:02,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210220008] [2022-10-16 17:28:02,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:02,954 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-16 17:28:02,970 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-16 17:28:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:03,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 17:28:03,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 17:28:03,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 17:28:03,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210220008] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:03,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:03,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-10-16 17:28:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664478295] [2022-10-16 17:28:03,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:03,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:28:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:28:03,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:28:03,293 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 17:28:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:03,343 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-10-16 17:28:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 17:28:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2022-10-16 17:28:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:03,345 INFO L225 Difference]: With dead ends: 34 [2022-10-16 17:28:03,345 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 17:28:03,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:28:03,348 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:03,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:28:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 17:28:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-16 17:28:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 17:28:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-10-16 17:28:03,359 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-10-16 17:28:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:03,359 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-10-16 17:28:03,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 17:28:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-10-16 17:28:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 17:28:03,361 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:03,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-16 17:28:03,400 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-16 17:28:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:03,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 551123241, now seen corresponding path program 1 times [2022-10-16 17:28:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:03,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569941702] [2022-10-16 17:28:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 17:28:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:03,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569941702] [2022-10-16 17:28:03,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569941702] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:28:03,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:28:03,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 17:28:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988731549] [2022-10-16 17:28:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:28:03,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:28:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:28:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:28:03,764 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 17:28:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:03,819 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-10-16 17:28:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 17:28:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-10-16 17:28:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:03,822 INFO L225 Difference]: With dead ends: 49 [2022-10-16 17:28:03,822 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 17:28:03,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-16 17:28:03,824 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:03,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:28:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 17:28:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-10-16 17:28:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-16 17:28:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-10-16 17:28:03,836 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-10-16 17:28:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:03,837 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-10-16 17:28:03,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 17:28:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-10-16 17:28:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 17:28:03,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:03,839 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-16 17:28:03,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:28:03,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 551123433, now seen corresponding path program 1 times [2022-10-16 17:28:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:03,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087105881] [2022-10-16 17:28:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 17:28:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:04,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087105881] [2022-10-16 17:28:04,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087105881] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:28:04,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:28:04,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:28:04,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799523146] [2022-10-16 17:28:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:28:04,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:28:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:28:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:28:04,090 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 17:28:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:04,188 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-10-16 17:28:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:28:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-10-16 17:28:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:04,192 INFO L225 Difference]: With dead ends: 44 [2022-10-16 17:28:04,192 INFO L226 Difference]: Without dead ends: 43 [2022-10-16 17:28:04,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:28:04,199 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:04,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 86 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:28:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-16 17:28:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-10-16 17:28:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.206896551724138) internal successors, (35), 32 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-16 17:28:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-10-16 17:28:04,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 33 [2022-10-16 17:28:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:04,215 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-10-16 17:28:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 17:28:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-10-16 17:28:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 17:28:04,216 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:04,217 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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-16 17:28:04,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:28:04,217 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash -95042683, now seen corresponding path program 1 times [2022-10-16 17:28:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:04,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264568722] [2022-10-16 17:28:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 17:28:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:04,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264568722] [2022-10-16 17:28:04,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264568722] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:28:04,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:28:04,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:28:04,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595402384] [2022-10-16 17:28:04,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:28:04,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:28:04,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:28:04,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:28:04,377 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 17:28:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:04,469 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-10-16 17:28:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 17:28:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-10-16 17:28:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:04,472 INFO L225 Difference]: With dead ends: 45 [2022-10-16 17:28:04,472 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 17:28:04,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:28:04,482 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:04,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 171 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:28:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 17:28:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-10-16 17:28:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-16 17:28:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-16 17:28:04,502 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2022-10-16 17:28:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:04,505 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-16 17:28:04,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 17:28:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-16 17:28:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-16 17:28:04,509 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:04,509 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-16 17:28:04,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 17:28:04,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1626861010, now seen corresponding path program 1 times [2022-10-16 17:28:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:04,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856729544] [2022-10-16 17:28:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:04,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856729544] [2022-10-16 17:28:04,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856729544] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:04,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221020432] [2022-10-16 17:28:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:04,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:04,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:04,779 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-16 17:28:04,794 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-16 17:28:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:04,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 17:28:04,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:04,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:05,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221020432] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:05,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:05,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-10-16 17:28:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259908631] [2022-10-16 17:28:05,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:05,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 17:28:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 17:28:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:28:05,039 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-10-16 17:28:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:05,305 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-10-16 17:28:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 17:28:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 50 [2022-10-16 17:28:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:05,308 INFO L225 Difference]: With dead ends: 87 [2022-10-16 17:28:05,308 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 17:28:05,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2022-10-16 17:28:05,309 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 113 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:05,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 229 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:28:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 17:28:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-10-16 17:28:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 55 states have internal predecessors, (65), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-16 17:28:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-10-16 17:28:05,337 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 50 [2022-10-16 17:28:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:05,340 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-10-16 17:28:05,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-10-16 17:28:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-10-16 17:28:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 17:28:05,342 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:05,343 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-10-16 17:28:05,380 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-16 17:28:05,557 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,SelfDestructingSolverStorable6 [2022-10-16 17:28:05,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1106916314, now seen corresponding path program 1 times [2022-10-16 17:28:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570626532] [2022-10-16 17:28:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:05,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:05,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570626532] [2022-10-16 17:28:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570626532] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:05,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590421793] [2022-10-16 17:28:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:05,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:05,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:05,762 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-16 17:28:05,786 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-16 17:28:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:05,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 17:28:05,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:05,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:28:05,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590421793] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:28:05,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:28:05,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-10-16 17:28:05,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029704268] [2022-10-16 17:28:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:28:05,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:28:05,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:05,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:28:05,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:28:05,900 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:28:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:05,997 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-10-16 17:28:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:28:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-10-16 17:28:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:06,000 INFO L225 Difference]: With dead ends: 76 [2022-10-16 17:28:06,000 INFO L226 Difference]: Without dead ends: 75 [2022-10-16 17:28:06,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-10-16 17:28:06,002 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 33 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:06,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 161 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:28:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-16 17:28:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-10-16 17:28:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-16 17:28:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2022-10-16 17:28:06,015 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 51 [2022-10-16 17:28:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:06,016 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2022-10-16 17:28:06,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 17:28:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-10-16 17:28:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 17:28:06,017 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:06,017 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:06,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-16 17:28:06,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:06,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1106922272, now seen corresponding path program 1 times [2022-10-16 17:28:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:06,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817524416] [2022-10-16 17:28:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:06,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:06,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817524416] [2022-10-16 17:28:06,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817524416] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:06,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339289447] [2022-10-16 17:28:06,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:06,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:06,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:06,424 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-16 17:28:06,431 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-16 17:28:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:06,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 17:28:06,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:06,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 17:28:06,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339289447] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:06,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:06,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-10-16 17:28:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941202573] [2022-10-16 17:28:06,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:06,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 17:28:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 17:28:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-10-16 17:28:06,738 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-10-16 17:28:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:07,016 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2022-10-16 17:28:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:28:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 51 [2022-10-16 17:28:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:07,018 INFO L225 Difference]: With dead ends: 78 [2022-10-16 17:28:07,019 INFO L226 Difference]: Without dead ends: 77 [2022-10-16 17:28:07,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 17:28:07,020 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 67 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:07,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 323 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:28:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-16 17:28:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-10-16 17:28:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-16 17:28:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-10-16 17:28:07,033 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 51 [2022-10-16 17:28:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:07,034 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-10-16 17:28:07,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-10-16 17:28:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-10-16 17:28:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-16 17:28:07,036 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:07,036 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:07,073 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-16 17:28:07,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:07,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1638655593, now seen corresponding path program 2 times [2022-10-16 17:28:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:07,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409418586] [2022-10-16 17:28:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 17:28:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:28:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:28:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 17:28:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 17:28:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 17:28:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-10-16 17:28:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:07,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409418586] [2022-10-16 17:28:07,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409418586] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642678182] [2022-10-16 17:28:07,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:28:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:07,816 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-16 17:28:07,840 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-16 17:28:07,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:28:07,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:28:07,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 17:28:07,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-10-16 17:28:08,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-10-16 17:28:08,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642678182] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:08,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:08,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-10-16 17:28:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386280805] [2022-10-16 17:28:08,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:08,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-16 17:28:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-16 17:28:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2022-10-16 17:28:08,384 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-10-16 17:28:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:09,040 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-10-16 17:28:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 17:28:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 101 [2022-10-16 17:28:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:09,043 INFO L225 Difference]: With dead ends: 151 [2022-10-16 17:28:09,043 INFO L226 Difference]: Without dead ends: 150 [2022-10-16 17:28:09,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=986, Invalid=3046, Unknown=0, NotChecked=0, Total=4032 [2022-10-16 17:28:09,046 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 356 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:09,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 353 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 17:28:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-10-16 17:28:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 139. [2022-10-16 17:28:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.12) internal successors, (112), 101 states have internal predecessors, (112), 36 states have call successors, (36), 13 states have call predecessors, (36), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-10-16 17:28:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2022-10-16 17:28:09,068 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 101 [2022-10-16 17:28:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:09,069 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2022-10-16 17:28:09,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-10-16 17:28:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-10-16 17:28:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-10-16 17:28:09,072 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:09,073 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:09,098 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-16 17:28:09,284 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,SelfDestructingSolverStorable9 [2022-10-16 17:28:09,285 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:09,286 INFO L85 PathProgramCache]: Analyzing trace with hash 269196873, now seen corresponding path program 3 times [2022-10-16 17:28:09,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:09,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346007358] [2022-10-16 17:28:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 17:28:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:28:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:28:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 17:28:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 17:28:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 17:28:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-16 17:28:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:28:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:28:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 17:28:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 17:28:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-10-16 17:28:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:28:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-16 17:28:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-16 17:28:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 17:28:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-10-16 17:28:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 17:28:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-10-16 17:28:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:11,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346007358] [2022-10-16 17:28:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346007358] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316597337] [2022-10-16 17:28:11,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:28:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:11,157 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-16 17:28:11,183 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-16 17:28:11,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-10-16 17:28:11,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:28:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 17:28:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-10-16 17:28:11,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-10-16 17:28:11,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316597337] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:11,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:11,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2022-10-16 17:28:11,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379672188] [2022-10-16 17:28:11,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:11,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 17:28:11,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:11,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 17:28:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 17:28:11,970 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-10-16 17:28:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:14,956 INFO L93 Difference]: Finished difference Result 307 states and 381 transitions. [2022-10-16 17:28:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-16 17:28:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 203 [2022-10-16 17:28:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:14,962 INFO L225 Difference]: With dead ends: 307 [2022-10-16 17:28:14,963 INFO L226 Difference]: Without dead ends: 306 [2022-10-16 17:28:14,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5493 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4130, Invalid=14776, Unknown=0, NotChecked=0, Total=18906 [2022-10-16 17:28:14,974 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1119 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:14,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 744 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:28:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-10-16 17:28:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 255. [2022-10-16 17:28:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.1404494382022472) internal successors, (203), 178 states have internal predecessors, (203), 74 states have call successors, (74), 26 states have call predecessors, (74), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-10-16 17:28:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2022-10-16 17:28:15,024 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 203 [2022-10-16 17:28:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:15,025 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2022-10-16 17:28:15,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-10-16 17:28:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2022-10-16 17:28:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-10-16 17:28:15,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:15,035 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:15,074 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-16 17:28:15,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:15,250 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:15,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1401050065, now seen corresponding path program 1 times [2022-10-16 17:28:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:15,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565717218] [2022-10-16 17:28:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 17:28:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:28:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:28:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 17:28:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 17:28:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 17:28:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-16 17:28:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:28:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:28:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 17:28:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 17:28:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-10-16 17:28:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:28:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-16 17:28:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-16 17:28:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 17:28:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-10-16 17:28:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 17:28:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-10-16 17:28:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-10-16 17:28:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-10-16 17:28:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-10-16 17:28:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-10-16 17:28:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:17,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565717218] [2022-10-16 17:28:17,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565717218] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:17,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605196600] [2022-10-16 17:28:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:17,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:17,084 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-16 17:28:17,122 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-16 17:28:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:17,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 50 conjunts are in the unsatisfiable core [2022-10-16 17:28:17,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-10-16 17:28:17,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-10-16 17:28:18,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605196600] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:18,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:18,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 76 [2022-10-16 17:28:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113586635] [2022-10-16 17:28:18,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:18,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-10-16 17:28:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-10-16 17:28:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=4801, Unknown=0, NotChecked=0, Total=5852 [2022-10-16 17:28:18,718 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) [2022-10-16 17:28:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:21,449 INFO L93 Difference]: Finished difference Result 544 states and 706 transitions. [2022-10-16 17:28:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-16 17:28:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) Word has length 237 [2022-10-16 17:28:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:21,455 INFO L225 Difference]: With dead ends: 544 [2022-10-16 17:28:21,455 INFO L226 Difference]: Without dead ends: 543 [2022-10-16 17:28:21,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6403 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5207, Invalid=16549, Unknown=0, NotChecked=0, Total=21756 [2022-10-16 17:28:21,465 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 902 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:21,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 670 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 17:28:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-10-16 17:28:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 515. [2022-10-16 17:28:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 360 states have internal predecessors, (411), 152 states have call successors, (152), 52 states have call predecessors, (152), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-10-16 17:28:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 665 transitions. [2022-10-16 17:28:21,534 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 665 transitions. Word has length 237 [2022-10-16 17:28:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:21,535 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 665 transitions. [2022-10-16 17:28:21,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) [2022-10-16 17:28:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 665 transitions. [2022-10-16 17:28:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2022-10-16 17:28:21,547 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:21,547 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:21,581 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-16 17:28:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:21,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash 255499764, now seen corresponding path program 2 times [2022-10-16 17:28:21,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:21,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242303706] [2022-10-16 17:28:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:28:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:28:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:28:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:28:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:28:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:28:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 17:28:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:28:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:28:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 17:28:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 17:28:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 17:28:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-16 17:28:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:28:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:28:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 17:28:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 17:28:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-10-16 17:28:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:28:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-16 17:28:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-16 17:28:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 17:28:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-10-16 17:28:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 17:28:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-10-16 17:28:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-10-16 17:28:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-10-16 17:28:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-10-16 17:28:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-10-16 17:28:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-10-16 17:28:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-10-16 17:28:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-10-16 17:28:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-10-16 17:28:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-10-16 17:28:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-10-16 17:28:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-10-16 17:28:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-10-16 17:28:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-10-16 17:28:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-10-16 17:28:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-10-16 17:28:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-10-16 17:28:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-10-16 17:28:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-10-16 17:28:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-10-16 17:28:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-10-16 17:28:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-10-16 17:28:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-10-16 17:28:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-10-16 17:28:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-10-16 17:28:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-10-16 17:28:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:27,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-10-16 17:28:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:28,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-10-16 17:28:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-10-16 17:28:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-10-16 17:28:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:28:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-10-16 17:28:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:28:28,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242303706] [2022-10-16 17:28:28,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242303706] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:28:28,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863592769] [2022-10-16 17:28:28,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:28:28,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:28:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:28:28,018 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-16 17:28:28,037 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-16 17:28:28,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:28:28,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:28:28,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 102 conjunts are in the unsatisfiable core [2022-10-16 17:28:28,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:28:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-10-16 17:28:28,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:28:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-10-16 17:28:33,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863592769] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:28:33,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:28:33,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 154 [2022-10-16 17:28:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003628324] [2022-10-16 17:28:33,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:28:33,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-10-16 17:28:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:28:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-10-16 17:28:33,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4132, Invalid=19738, Unknown=0, NotChecked=0, Total=23870 [2022-10-16 17:28:33,454 INFO L87 Difference]: Start difference. First operand 515 states and 665 transitions. Second operand has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) [2022-10-16 17:28:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:28:43,616 INFO L93 Difference]: Finished difference Result 1090 states and 1421 transitions. [2022-10-16 17:28:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-10-16 17:28:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) Word has length 458 [2022-10-16 17:28:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:28:43,627 INFO L225 Difference]: With dead ends: 1090 [2022-10-16 17:28:43,628 INFO L226 Difference]: Without dead ends: 1089 [2022-10-16 17:28:43,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1273 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27814 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=21886, Invalid=70226, Unknown=0, NotChecked=0, Total=92112 [2022-10-16 17:28:43,641 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 2223 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:28:43,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 1497 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-10-16 17:28:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-10-16 17:28:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1035. [2022-10-16 17:28:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 724 states have (on average 1.1422651933701657) internal successors, (827), 724 states have internal predecessors, (827), 308 states have call successors, (308), 104 states have call predecessors, (308), 2 states have return successors, (206), 206 states have call predecessors, (206), 206 states have call successors, (206) [2022-10-16 17:28:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1341 transitions. [2022-10-16 17:28:43,740 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1341 transitions. Word has length 458 [2022-10-16 17:28:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:28:43,742 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1341 transitions. [2022-10-16 17:28:43,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) [2022-10-16 17:28:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1341 transitions. [2022-10-16 17:28:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-10-16 17:28:43,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:28:43,783 INFO L195 NwaCegarLoop]: trace histogram [54, 54, 54, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:28:43,823 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-16 17:28:43,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 17:28:43,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:28:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:28:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1135257556, now seen corresponding path program 3 times [2022-10-16 17:28:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:28:44,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871356475] [2022-10-16 17:28:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:28:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:28:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 17:29:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 17:29:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 17:29:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 17:29:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 17:29:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 17:29:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 17:29:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 17:29:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 17:29:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 17:29:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 17:29:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 17:29:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-16 17:29:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:29:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:29:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 17:29:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 17:29:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-10-16 17:29:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:29:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-16 17:29:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-16 17:29:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 17:29:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-10-16 17:29:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 17:29:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-10-16 17:29:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-10-16 17:29:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-10-16 17:29:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-10-16 17:29:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-10-16 17:29:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-10-16 17:29:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-10-16 17:29:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-10-16 17:29:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-10-16 17:29:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-10-16 17:29:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-10-16 17:29:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-10-16 17:29:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-10-16 17:29:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-10-16 17:29:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-10-16 17:29:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-10-16 17:29:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-10-16 17:29:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-10-16 17:29:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-10-16 17:29:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-10-16 17:29:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-10-16 17:29:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-10-16 17:29:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-10-16 17:29:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-10-16 17:29:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-10-16 17:29:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-10-16 17:29:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-10-16 17:29:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-10-16 17:29:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-10-16 17:29:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-10-16 17:29:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2022-10-16 17:29:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-10-16 17:29:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2022-10-16 17:29:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2022-10-16 17:29:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2022-10-16 17:29:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501 [2022-10-16 17:29:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2022-10-16 17:29:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2022-10-16 17:29:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2022-10-16 17:29:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2022-10-16 17:29:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2022-10-16 17:29:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2022-10-16 17:29:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2022-10-16 17:29:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 569 [2022-10-16 17:29:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2022-10-16 17:29:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2022-10-16 17:29:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2022-10-16 17:29:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2022-10-16 17:29:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 615 [2022-10-16 17:29:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 620 [2022-10-16 17:29:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2022-10-16 17:29:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2022-10-16 17:29:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 649 [2022-10-16 17:29:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 654 [2022-10-16 17:29:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2022-10-16 17:29:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2022-10-16 17:29:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2022-10-16 17:29:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2022-10-16 17:29:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 700 [2022-10-16 17:29:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 705 [2022-10-16 17:29:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-10-16 17:29:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 722 [2022-10-16 17:29:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2022-10-16 17:29:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2022-10-16 17:29:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2022-10-16 17:29:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2022-10-16 17:29:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 768 [2022-10-16 17:29:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 773 [2022-10-16 17:29:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2022-10-16 17:29:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 790 [2022-10-16 17:29:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 802 [2022-10-16 17:29:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 807 [2022-10-16 17:29:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2022-10-16 17:29:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 824 [2022-10-16 17:29:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 836 [2022-10-16 17:29:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 841 [2022-10-16 17:29:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 853 [2022-10-16 17:29:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 858 [2022-10-16 17:29:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2022-10-16 17:29:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2022-10-16 17:29:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 887 [2022-10-16 17:29:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 892 [2022-10-16 17:29:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:29:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22759 backedges. 0 proven. 11724 refuted. 0 times theorem prover too weak. 11035 trivial. 0 not checked. [2022-10-16 17:29:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:29:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871356475] [2022-10-16 17:29:06,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871356475] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:29:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550267792] [2022-10-16 17:29:06,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:29:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:29:06,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:29:06,811 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-16 17:29:06,832 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-16 17:29:06,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-10-16 17:29:06,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:29:06,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 17:29:06,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:29:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22759 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 22353 trivial. 0 not checked. [2022-10-16 17:29:07,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:29:07,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550267792] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:29:07,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:29:07,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [154] total 159 [2022-10-16 17:29:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503712622] [2022-10-16 17:29:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:29:07,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:29:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:29:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:29:07,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4244, Invalid=21196, Unknown=0, NotChecked=0, Total=25440 [2022-10-16 17:29:07,435 INFO L87 Difference]: Start difference. First operand 1035 states and 1341 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 17:29:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:29:07,915 INFO L93 Difference]: Finished difference Result 1238 states and 1544 transitions. [2022-10-16 17:29:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:29:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 900 [2022-10-16 17:29:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:29:07,919 INFO L225 Difference]: With dead ends: 1238 [2022-10-16 17:29:07,919 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 17:29:07,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1323 GetRequests, 1161 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8152 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=4270, Invalid=22462, Unknown=0, NotChecked=0, Total=26732 [2022-10-16 17:29:07,931 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:29:07,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 177 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:29:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 17:29:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 17:29:07,933 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-16 17:29:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 17:29:07,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 900 [2022-10-16 17:29:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:29:07,934 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 17:29:07,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 17:29:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 17:29:07,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 17:29:07,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-10-16 17:29:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-10-16 17:29:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-10-16 17:29:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-10-16 17:29:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-10-16 17:29:07,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-10-16 17:29:07,981 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-16 17:29:08,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 17:29:08,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 17:29:31,722 WARN L233 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 854 DAG size of output: 269 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 17:29:31,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-10-16 17:29:31,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 17:29:31,732 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 17:29:31,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-10-16 17:29:31,732 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-10-16 17:29:31,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 17:29:31,733 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 17:29:31,733 INFO L902 garLoopResultBuilder]: At program point L53(lines 40 54) the Hoare annotation is: true [2022-10-16 17:29:31,733 INFO L902 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-10-16 17:29:31,733 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-10-16 17:29:31,733 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-10-16 17:29:31,733 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-10-16 17:29:31,734 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-10-16 17:29:31,734 INFO L895 garLoopResultBuilder]: At program point L47-2(line 47) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-10-16 17:29:31,734 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-10-16 17:29:31,734 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2022-10-16 17:29:31,734 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 2147483647) [2022-10-16 17:29:31,734 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-10-16 17:29:31,734 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-10-16 17:29:31,734 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-10-16 17:29:31,734 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L902 garLoopResultBuilder]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-10-16 17:29:31,735 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 16 38) no Hoare annotation was computed. [2022-10-16 17:29:31,736 INFO L899 garLoopResultBuilder]: For program point checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-10-16 17:29:31,736 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2022-10-16 17:29:31,736 INFO L899 garLoopResultBuilder]: For program point checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-10-16 17:29:31,736 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-10-16 17:29:31,736 INFO L899 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2022-10-16 17:29:31,738 INFO L895 garLoopResultBuilder]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse4 (<= |check_#in~y| 2147483646))) (let ((.cse5 (<= 1 check_~y)) (.cse6 (<= 1 check_~x)) (.cse3 (<= check_~y 2147483646)) (.cse0 (not .cse4)) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (< check_~x 2147483647) (not (< |check_#in~x| 2147483647))) (or .cse0 (<= check_~x 16) .cse1 .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (< check_~x 2147483646) (not (< |check_#in~x| 2147483645)) .cse1 .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483623)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (< check_~x 2147483627) .cse2 (not (< |check_#in~x| 2147483626))) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483631) .cse2) (or .cse0 (<= check_~x 23) .cse1 (not (<= |check_#in~x| 22)) .cse2) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483637))) (or .cse0 (<= check_~x 19) .cse1 (not (<= |check_#in~x| 18)) .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483625)) (< check_~x 2147483626)) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 7))) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483644)) (< check_~x 2147483645)) (or .cse0 .cse1 (< check_~x 2147483632) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 (<= check_~x 24) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 .cse1 (< check_~x 2147483634) .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483643)) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) (<= check_~x 15) .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483627)) .cse2 (< check_~x 2147483628)) (or (not (<= |check_#in~x| 16)) .cse0 .cse1 (<= check_~x 17) .cse2) (or .cse0 (<= check_~x 9) .cse1 .cse2 (not (<= |check_#in~x| 8))) (or .cse0 (not (= |check_#in~x| 0)) (and (= check_~x 0) (< 0 (+ check_~y 2147483648)) .cse3) (and .cse4 .cse5 (<= check_~x 1) .cse6 .cse3)) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483635) .cse2) (or .cse0 .cse1 (<= check_~x 5) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 21)) (<= check_~x 22)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 .cse1 (<= check_~x 12) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (not (<= |check_#in~x| 17)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 (< check_~x 2147483630) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (< check_~x 2147483625) .cse1 (not (< |check_#in~x| 2147483624)) .cse2) (or (not (<= |check_#in~x| 24)) .cse0 .cse1 (< check_~x 2147483623) .cse2) (or .cse0 .cse1 (and .cse4 .cse5 .cse6 .cse3) .cse2) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 11) .cse2) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (<= check_~x 2) (not (<= |check_#in~x| 1)) .cse2) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 14)) (or (not (< |check_#in~x| 2147483632)) .cse0 (< check_~x 2147483633) .cse1 .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) (< check_~x 2147483636) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483640)) (< check_~x 2147483641)) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) .cse2 (<= check_~x 6)) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483628))) (or .cse0 (not (<= |check_#in~x| 9)) .cse1 (<= check_~x 10) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) .cse2 (<= check_~x 13))))) [2022-10-16 17:29:31,740 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (not (<= |check_#in~y| 2147483646))) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483630) .cse2) (or .cse0 .cse1 (and (<= 2 check_~y) (<= 1 check_~x) .cse3) .cse2) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 21))) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) .cse2 (<= check_~x 14)) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 10) .cse2) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse3) (not (= |check_#in~x| 0))) (or (not (<= |check_#in~x| 24)) .cse0 (<= check_~x 24) .cse1 .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 22)) .cse2 (<= check_~x 22)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 (not (<= |check_#in~x| 18)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 13)) (or .cse0 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483628)) (< check_~x 2147483628)) (or .cse0 .cse1 .cse2 (< check_~x 2147483626) (not (< |check_#in~x| 2147483626))) (or .cse0 .cse1 .cse2 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483624)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse2) (or .cse0 .cse1 (<= check_~x 15) .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483631) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483640))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 .cse2 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (< check_~x 2147483623) (not (< |check_#in~x| 2147483623)) .cse2) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (<= check_~x 23) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 (< check_~x 2147483636) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (<= check_~x 19) .cse1 .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (<= check_~x 2) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (not (< |check_#in~x| 2147483645)) .cse1 .cse2 (< check_~x 2147483645)) (or (not (< |check_#in~x| 2147483632)) .cse0 .cse1 (< check_~x 2147483632) .cse2) (or .cse0 (< check_~x 2147483633) .cse1 .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) (<= check_~x 12) .cse2) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483634) .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) .cse1 (< check_~x 2147483635) .cse2) (or (not (<= |check_#in~x| 16)) .cse0 (<= check_~x 16) .cse1 .cse2) (or .cse0 (< check_~x 2147483625) .cse1 .cse2 (not (< |check_#in~x| 2147483625))) (or .cse0 .cse1 (<= check_~x 11) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (<= check_~x 17) (not (<= |check_#in~x| 17)) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 1)) .cse2 (<= check_~x 1)) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483641)) (or .cse0 .cse1 (< check_~x 2147483627) (not (< |check_#in~x| 2147483627)) .cse2))) [2022-10-16 17:29:31,742 INFO L895 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (not (<= |check_#in~y| 2147483646))) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483630) .cse2) (or .cse0 .cse1 (and (<= 2 check_~y) (<= 1 check_~x) .cse3) .cse2) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 21))) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) .cse2 (<= check_~x 14)) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 10) .cse2) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse3) (not (= |check_#in~x| 0))) (or (not (<= |check_#in~x| 24)) .cse0 (<= check_~x 24) .cse1 .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 22)) .cse2 (<= check_~x 22)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 (not (<= |check_#in~x| 18)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 13)) (or .cse0 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483628)) (< check_~x 2147483628)) (or .cse0 .cse1 .cse2 (< check_~x 2147483626) (not (< |check_#in~x| 2147483626))) (or .cse0 .cse1 .cse2 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483624)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse2) (or .cse0 .cse1 (<= check_~x 15) .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483631) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483640))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 .cse2 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (< check_~x 2147483623) (not (< |check_#in~x| 2147483623)) .cse2) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (<= check_~x 23) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 (< check_~x 2147483636) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (<= check_~x 19) .cse1 .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (<= check_~x 2) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (not (< |check_#in~x| 2147483645)) .cse1 .cse2 (< check_~x 2147483645)) (or (not (< |check_#in~x| 2147483632)) .cse0 .cse1 (< check_~x 2147483632) .cse2) (or .cse0 (< check_~x 2147483633) .cse1 .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) (<= check_~x 12) .cse2) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483634) .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) .cse1 (< check_~x 2147483635) .cse2) (or (not (<= |check_#in~x| 16)) .cse0 (<= check_~x 16) .cse1 .cse2) (or .cse0 (< check_~x 2147483625) .cse1 .cse2 (not (< |check_#in~x| 2147483625))) (or .cse0 .cse1 (<= check_~x 11) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (<= check_~x 17) (not (<= |check_#in~x| 17)) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 1)) .cse2 (<= check_~x 1)) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483641)) (or .cse0 .cse1 (< check_~x 2147483627) (not (< |check_#in~x| 2147483627)) .cse2))) [2022-10-16 17:29:31,742 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 16 38) no Hoare annotation was computed. [2022-10-16 17:29:31,742 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-10-16 17:29:31,742 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-10-16 17:29:31,743 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-10-16 17:29:31,743 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-10-16 17:29:31,743 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2022-10-16 17:29:31,743 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2022-10-16 17:29:31,747 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:29:31,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 17:29:31,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:29:31 BoogieIcfgContainer [2022-10-16 17:29:31,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 17:29:31,761 INFO L158 Benchmark]: Toolchain (without parser) took 90741.96ms. Allocated memory was 154.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.2MB in the beginning and 792.0MB in the end (delta: -662.8MB). Peak memory consumption was 860.7MB. Max. memory is 8.0GB. [2022-10-16 17:29:31,761 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 154.1MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 17:29:31,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.25ms. Allocated memory is still 154.1MB. Free memory was 129.0MB in the beginning and 119.0MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-16 17:29:31,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.44ms. Allocated memory is still 154.1MB. Free memory was 118.8MB in the beginning and 117.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:29:31,763 INFO L158 Benchmark]: Boogie Preprocessor took 31.64ms. Allocated memory is still 154.1MB. Free memory was 117.3MB in the beginning and 116.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 17:29:31,763 INFO L158 Benchmark]: RCFGBuilder took 567.57ms. Allocated memory is still 154.1MB. Free memory was 116.0MB in the beginning and 103.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 17:29:31,764 INFO L158 Benchmark]: TraceAbstraction took 89764.23ms. Allocated memory was 154.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 102.6MB in the beginning and 792.0MB in the end (delta: -689.4MB). Peak memory consumption was 833.5MB. Max. memory is 8.0GB. [2022-10-16 17:29:31,766 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.17ms. Allocated memory is still 154.1MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.25ms. Allocated memory is still 154.1MB. Free memory was 129.0MB in the beginning and 119.0MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.44ms. Allocated memory is still 154.1MB. Free memory was 118.8MB in the beginning and 117.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.64ms. Allocated memory is still 154.1MB. Free memory was 117.3MB in the beginning and 116.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 567.57ms. Allocated memory is still 154.1MB. Free memory was 116.0MB in the beginning and 103.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 89764.23ms. Allocated memory was 154.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 102.6MB in the beginning and 792.0MB in the end (delta: -689.4MB). Peak memory consumption was 833.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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 89.7s, OverallIterations: 14, TraceHistogramMax: 54, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4892 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4892 mSDsluCounter, 4741 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4078 mSDsCounter, 1380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3588 IncrementalHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1380 mSolverCounterUnsat, 663 mSDtfsCounter, 3588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4546 GetRequests, 3637 SyntacticMatches, 0 SemanticMatches, 909 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49364 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1035occurred in iteration=13, InterpolantAutomatonStates: 534, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 1243 PreInvPairs, 2059 NumberOfFragments, 3049 HoareAnnotationTreeSize, 1243 FomulaSimplifications, 4701 FormulaSimplificationTreeSizeReduction, 7.7s HoareSimplificationTime, 12 FomulaSimplificationsInter, 524052 FormulaSimplificationTreeSizeReductionInter, 15.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 41.9s InterpolantComputationTime, 4268 NumberOfCodeBlocks, 3395 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 9750 SizeOfPredicates, 118 NumberOfNonLiveVariables, 4381 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 47569/70567 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 6 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-10-16 17:29:31,823 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...