/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/list-simple/sll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:39:04,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:39:04,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:39:04,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:39:04,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:39:04,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:39:04,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:39:04,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:39:04,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:39:04,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:39:04,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:39:04,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:39:04,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:39:04,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:39:04,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:39:04,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:39:04,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:39:04,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:39:04,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:39:04,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:39:04,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:39:04,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:39:04,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:39:04,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:39:04,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:39:04,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:39:04,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:39:04,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:39:04,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:39:04,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:39:04,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:39:04,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:39:04,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:39:04,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:39:04,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:39:04,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:39:04,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:39:04,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:39:04,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:39:04,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:39:04,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:39:04,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:39:04,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:39:04,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:39:04,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:39:04,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:39:04,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:39:04,610 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:39:04,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:39:04,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:39:04,612 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:39:04,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:39:04,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:39:04,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:39:04,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:39:04,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:39:04,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:39:04,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:39:04,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:39:04,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:39:04,615 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:39:04,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:39:04,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:39:04,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:39:04,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:39:04,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:39:04,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:39:04,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:39:04,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:39:04,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:39:04,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:39:04,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:39:04,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:39:04,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:39:04,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:39:04,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:39:04,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:39:05,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:39:05,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:39:05,055 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:39:05,056 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:39:05,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-10-15 21:39:05,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8195ebc6f/5684bbf4053e4ffb914a7653affe7304/FLAG8ee0d5593 [2022-10-15 21:39:05,818 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:39:05,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-10-15 21:39:05,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8195ebc6f/5684bbf4053e4ffb914a7653affe7304/FLAG8ee0d5593 [2022-10-15 21:39:06,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8195ebc6f/5684bbf4053e4ffb914a7653affe7304 [2022-10-15 21:39:06,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:39:06,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:39:06,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:39:06,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:39:06,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:39:06,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f3ec9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06, skipping insertion in model container [2022-10-15 21:39:06,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:39:06,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:39:06,747 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/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-10-15 21:39:06,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:39:06,767 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:39:06,860 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/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-10-15 21:39:06,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:39:06,901 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:39:06,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06 WrapperNode [2022-10-15 21:39:06,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:39:06,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:39:06,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:39:06,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:39:06,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,959 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-10-15 21:39:06,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:39:06,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:39:06,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:39:06,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:39:06,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:06,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:07,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:07,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:07,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:07,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:07,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:39:07,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:39:07,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:39:07,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:39:07,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (1/1) ... [2022-10-15 21:39:07,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:39:07,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:07,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:39:07,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:39:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:39:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:39:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-10-15 21:39:07,122 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-10-15 21:39:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:39:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:39:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:39:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:39:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:39:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:39:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:39:07,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:39:07,253 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:39:07,256 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:39:07,783 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:39:07,800 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:39:07,800 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-15 21:39:07,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:39:07 BoogieIcfgContainer [2022-10-15 21:39:07,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:39:07,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:39:07,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:39:07,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:39:07,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:39:06" (1/3) ... [2022-10-15 21:39:07,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e41bc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:39:07, skipping insertion in model container [2022-10-15 21:39:07,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:39:06" (2/3) ... [2022-10-15 21:39:07,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e41bc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:39:07, skipping insertion in model container [2022-10-15 21:39:07,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:39:07" (3/3) ... [2022-10-15 21:39:07,816 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-10-15 21:39:07,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:39:07,841 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 21:39:07,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:39:07,915 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;@86062b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:39:07,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 21:39:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 67 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 21:39:07,930 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:07,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:07,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1926439242, now seen corresponding path program 1 times [2022-10-15 21:39:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:07,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223180447] [2022-10-15 21:39:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:39:08,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:08,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223180447] [2022-10-15 21:39:08,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223180447] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:08,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:08,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:39:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72746645] [2022-10-15 21:39:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:08,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:39:08,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:39:08,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:39:08,340 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 67 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:39:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:08,411 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-10-15 21:39:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:39:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-15 21:39:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:08,423 INFO L225 Difference]: With dead ends: 125 [2022-10-15 21:39:08,424 INFO L226 Difference]: Without dead ends: 61 [2022-10-15 21:39:08,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:39:08,432 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:08,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-15 21:39:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-15 21:39:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.55) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-10-15 21:39:08,485 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 13 [2022-10-15 21:39:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:08,487 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-10-15 21:39:08,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:39:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-10-15 21:39:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 21:39:08,489 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:08,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:08,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:39:08,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1926141332, now seen corresponding path program 1 times [2022-10-15 21:39:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760222566] [2022-10-15 21:39:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:08,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:39:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:08,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760222566] [2022-10-15 21:39:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760222566] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:08,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:08,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:39:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082977109] [2022-10-15 21:39:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:08,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:39:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:39:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:39:08,754 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:39:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:08,826 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-10-15 21:39:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:39:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-15 21:39:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:08,829 INFO L225 Difference]: With dead ends: 113 [2022-10-15 21:39:08,829 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 21:39:08,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:39:08,832 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:08,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 21:39:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-10-15 21:39:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-10-15 21:39:08,846 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 13 [2022-10-15 21:39:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:08,846 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-10-15 21:39:08,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:39:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-10-15 21:39:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 21:39:08,848 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:08,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:08,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:39:08,849 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -154583391, now seen corresponding path program 1 times [2022-10-15 21:39:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005905813] [2022-10-15 21:39:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:09,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:09,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005905813] [2022-10-15 21:39:09,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005905813] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:09,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:09,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:39:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251994558] [2022-10-15 21:39:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:09,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:09,196 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-15 21:39:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:09,310 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-10-15 21:39:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:39:09,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2022-10-15 21:39:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:09,316 INFO L225 Difference]: With dead ends: 68 [2022-10-15 21:39:09,317 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 21:39:09,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:09,327 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:09,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 230 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 21:39:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-10-15 21:39:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:39:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-10-15 21:39:09,351 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 18 [2022-10-15 21:39:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:09,351 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-10-15 21:39:09,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-15 21:39:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-10-15 21:39:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 21:39:09,354 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:09,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:39:09,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash -497117776, now seen corresponding path program 1 times [2022-10-15 21:39:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:09,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946467184] [2022-10-15 21:39:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:09,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946467184] [2022-10-15 21:39:09,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946467184] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:09,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:09,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:39:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16119793] [2022-10-15 21:39:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:09,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:09,641 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-15 21:39:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:09,713 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-10-15 21:39:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:39:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2022-10-15 21:39:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:09,717 INFO L225 Difference]: With dead ends: 67 [2022-10-15 21:39:09,718 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 21:39:09,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:09,729 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:09,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 232 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 21:39:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 21:39:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.5) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:39:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-10-15 21:39:09,747 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 19 [2022-10-15 21:39:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:09,747 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-10-15 21:39:09,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-15 21:39:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-10-15 21:39:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 21:39:09,751 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:09,751 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:39:09,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1060131138, now seen corresponding path program 1 times [2022-10-15 21:39:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484151816] [2022-10-15 21:39:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:10,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484151816] [2022-10-15 21:39:10,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484151816] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582811286] [2022-10-15 21:39:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:10,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:10,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:39:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:39:10,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:10,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:10,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582811286] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:10,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:10,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2022-10-15 21:39:10,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819128560] [2022-10-15 21:39:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:10,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:39:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:39:10,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:10,291 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-15 21:39:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:10,321 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-10-15 21:39:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:39:10,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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 23 [2022-10-15 21:39:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:10,326 INFO L225 Difference]: With dead ends: 66 [2022-10-15 21:39:10,327 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 21:39:10,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:10,328 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:10,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 57 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 21:39:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 21:39:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:39:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-10-15 21:39:10,354 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 23 [2022-10-15 21:39:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:10,354 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-10-15 21:39:10,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-15 21:39:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-10-15 21:39:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 21:39:10,357 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:10,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:10,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-15 21:39:10,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:10,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1495673149, now seen corresponding path program 1 times [2022-10-15 21:39:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032240841] [2022-10-15 21:39:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:10,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032240841] [2022-10-15 21:39:10,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032240841] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:10,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662243639] [2022-10-15 21:39:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:10,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:10,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:10,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:10,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:39:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:10,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:39:10,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:10,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662243639] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2022-10-15 21:39:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242292386] [2022-10-15 21:39:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:10,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:39:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:39:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:10,912 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-15 21:39:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:10,931 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-10-15 21:39:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:39:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2022-10-15 21:39:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:10,933 INFO L225 Difference]: With dead ends: 64 [2022-10-15 21:39:10,933 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 21:39:10,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:10,934 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:10,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 21:39:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-10-15 21:39:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:39:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-10-15 21:39:10,941 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2022-10-15 21:39:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:10,941 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-10-15 21:39:10,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-15 21:39:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-10-15 21:39:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 21:39:10,943 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:10,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:10,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:11,157 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,SelfDestructingSolverStorable5 [2022-10-15 21:39:11,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1472145825, now seen corresponding path program 1 times [2022-10-15 21:39:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768490022] [2022-10-15 21:39:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768490022] [2022-10-15 21:39:11,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768490022] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501930719] [2022-10-15 21:39:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:11,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:11,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:39:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:39:11,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:11,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:11,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501930719] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:11,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:11,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 21:39:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015943923] [2022-10-15 21:39:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:11,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:39:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:39:11,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:11,533 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:11,604 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-10-15 21:39:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:39:11,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-10-15 21:39:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:11,605 INFO L225 Difference]: With dead ends: 99 [2022-10-15 21:39:11,606 INFO L226 Difference]: Without dead ends: 97 [2022-10-15 21:39:11,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:11,607 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 79 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:11,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-15 21:39:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2022-10-15 21:39:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:39:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-15 21:39:11,615 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 26 [2022-10-15 21:39:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:11,615 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-15 21:39:11,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-15 21:39:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 21:39:11,617 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:11,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:11,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:11,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:11,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1608119752, now seen corresponding path program 1 times [2022-10-15 21:39:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:11,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895883991] [2022-10-15 21:39:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895883991] [2022-10-15 21:39:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895883991] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:11,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:11,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:39:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191543404] [2022-10-15 21:39:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:11,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:11,927 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:11,993 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-10-15 21:39:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:39:11,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-10-15 21:39:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:11,995 INFO L225 Difference]: With dead ends: 66 [2022-10-15 21:39:11,995 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 21:39:11,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:11,996 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:11,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 105 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 21:39:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 21:39:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 59 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:39:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-10-15 21:39:12,004 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 27 [2022-10-15 21:39:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:12,005 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-10-15 21:39:12,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-10-15 21:39:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 21:39:12,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:12,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:12,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:39:12,007 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 842747831, now seen corresponding path program 1 times [2022-10-15 21:39:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38808901] [2022-10-15 21:39:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 21:39:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:39:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38808901] [2022-10-15 21:39:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38808901] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173708920] [2022-10-15 21:39:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:12,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:12,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:12,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 21:39:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:39:12,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:12,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:12,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173708920] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:12,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:12,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-10-15 21:39:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792547471] [2022-10-15 21:39:12,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:12,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:12,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:12,342 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:39:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:12,369 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-10-15 21:39:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:39:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-10-15 21:39:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:12,371 INFO L225 Difference]: With dead ends: 113 [2022-10-15 21:39:12,371 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 21:39:12,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:12,374 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 88 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:12,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 113 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 21:39:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-10-15 21:39:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-10-15 21:39:12,385 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 28 [2022-10-15 21:39:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:12,385 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-10-15 21:39:12,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:39:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-10-15 21:39:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:39:12,391 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:12,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:12,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:12,605 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-15 21:39:12,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -785142326, now seen corresponding path program 1 times [2022-10-15 21:39:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:12,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748588322] [2022-10-15 21:39:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:12,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748588322] [2022-10-15 21:39:12,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748588322] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:12,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588805810] [2022-10-15 21:39:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:12,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:12,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:12,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-15 21:39:12,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 21:39:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:12,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:39:12,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:13,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:13,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588805810] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:13,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:13,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-15 21:39:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702080004] [2022-10-15 21:39:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:13,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:39:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:39:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:13,004 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-15 21:39:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:13,142 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-10-15 21:39:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:39:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 29 [2022-10-15 21:39:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:13,144 INFO L225 Difference]: With dead ends: 120 [2022-10-15 21:39:13,144 INFO L226 Difference]: Without dead ends: 119 [2022-10-15 21:39:13,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:39:13,145 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 158 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:13,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 197 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-15 21:39:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 62. [2022-10-15 21:39:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-15 21:39:13,160 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 29 [2022-10-15 21:39:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:13,162 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-15 21:39:13,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-15 21:39:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-15 21:39:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:39:13,163 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:13,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:13,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:13,381 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-15 21:39:13,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1430391754, now seen corresponding path program 1 times [2022-10-15 21:39:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:13,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872161992] [2022-10-15 21:39:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:13,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:13,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872161992] [2022-10-15 21:39:13,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872161992] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:13,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:13,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:39:13,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082717914] [2022-10-15 21:39:13,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:13,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:39:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:39:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:39:13,478 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-15 21:39:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:13,510 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-10-15 21:39:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:39:13,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 30 [2022-10-15 21:39:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:13,512 INFO L225 Difference]: With dead ends: 62 [2022-10-15 21:39:13,512 INFO L226 Difference]: Without dead ends: 61 [2022-10-15 21:39:13,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:39:13,513 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:13,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-15 21:39:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-15 21:39:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-10-15 21:39:13,521 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 30 [2022-10-15 21:39:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:13,522 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-10-15 21:39:13,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-15 21:39:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-10-15 21:39:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 21:39:13,523 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:13,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:13,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:39:13,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash 307353485, now seen corresponding path program 1 times [2022-10-15 21:39:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:13,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791623023] [2022-10-15 21:39:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791623023] [2022-10-15 21:39:13,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791623023] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763683012] [2022-10-15 21:39:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:13,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:13,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:13,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:13,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 21:39:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:13,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:39:13,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:13,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:13,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763683012] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:13,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:13,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-10-15 21:39:13,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029005743] [2022-10-15 21:39:13,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:13,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:39:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:13,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:39:13,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:13,833 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:13,880 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-10-15 21:39:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:39:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-10-15 21:39:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:13,881 INFO L225 Difference]: With dead ends: 103 [2022-10-15 21:39:13,882 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 21:39:13,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:13,883 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 98 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:13,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 21:39:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2022-10-15 21:39:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-10-15 21:39:13,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 32 [2022-10-15 21:39:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:13,891 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-10-15 21:39:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-10-15 21:39:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 21:39:13,892 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:13,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:13,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:14,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:14,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 215281290, now seen corresponding path program 1 times [2022-10-15 21:39:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:14,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549159126] [2022-10-15 21:39:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549159126] [2022-10-15 21:39:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549159126] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:14,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:14,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:39:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318477109] [2022-10-15 21:39:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:14,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:39:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:39:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:14,253 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:14,346 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-10-15 21:39:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:39:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-10-15 21:39:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:14,348 INFO L225 Difference]: With dead ends: 115 [2022-10-15 21:39:14,348 INFO L226 Difference]: Without dead ends: 79 [2022-10-15 21:39:14,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-15 21:39:14,349 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:14,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 205 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-15 21:39:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2022-10-15 21:39:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.3) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-10-15 21:39:14,359 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 32 [2022-10-15 21:39:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:14,359 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-10-15 21:39:14,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:39:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-10-15 21:39:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 21:39:14,360 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:14,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:14,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:39:14,360 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1916214506, now seen corresponding path program 1 times [2022-10-15 21:39:14,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:14,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977136858] [2022-10-15 21:39:14,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:14,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977136858] [2022-10-15 21:39:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977136858] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376596573] [2022-10-15 21:39:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:14,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:14,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 21:39:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:14,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:39:14,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:14,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376596573] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:14,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:14,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-10-15 21:39:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392939664] [2022-10-15 21:39:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:14,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:14,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:14,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:14,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:14,758 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-15 21:39:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:14,842 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-10-15 21:39:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:39:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 33 [2022-10-15 21:39:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:14,845 INFO L225 Difference]: With dead ends: 125 [2022-10-15 21:39:14,845 INFO L226 Difference]: Without dead ends: 93 [2022-10-15 21:39:14,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:39:14,850 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:14,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 125 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-15 21:39:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-10-15 21:39:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-10-15 21:39:14,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 33 [2022-10-15 21:39:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:14,864 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-10-15 21:39:14,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-15 21:39:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-10-15 21:39:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:39:14,865 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:14,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:14,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:15,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:15,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -965457464, now seen corresponding path program 1 times [2022-10-15 21:39:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:15,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485958653] [2022-10-15 21:39:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:15,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485958653] [2022-10-15 21:39:15,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485958653] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:15,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311892102] [2022-10-15 21:39:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:15,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:15,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:15,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 21:39:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:39:15,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:39:15,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:15,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311892102] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:15,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:15,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-10-15 21:39:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207464989] [2022-10-15 21:39:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:15,472 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-15 21:39:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:15,522 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-10-15 21:39:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:39:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 35 [2022-10-15 21:39:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:15,523 INFO L225 Difference]: With dead ends: 86 [2022-10-15 21:39:15,523 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 21:39:15,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:39:15,524 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:15,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 110 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 21:39:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2022-10-15 21:39:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 66 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-10-15 21:39:15,533 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 35 [2022-10-15 21:39:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:15,534 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-10-15 21:39:15,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-15 21:39:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-10-15 21:39:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 21:39:15,535 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:15,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:15,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:15,748 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,SelfDestructingSolverStorable14 [2022-10-15 21:39:15,749 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 135589784, now seen corresponding path program 1 times [2022-10-15 21:39:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:15,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203352182] [2022-10-15 21:39:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:15,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203352182] [2022-10-15 21:39:15,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203352182] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:15,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364510027] [2022-10-15 21:39:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:15,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:15,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:15,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 21:39:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:16,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:39:16,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:39:16,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:16,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364510027] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:16,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:16,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-10-15 21:39:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299028004] [2022-10-15 21:39:16,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:16,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:16,076 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-15 21:39:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:16,131 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-10-15 21:39:16,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:39:16,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 36 [2022-10-15 21:39:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:16,132 INFO L225 Difference]: With dead ends: 90 [2022-10-15 21:39:16,133 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 21:39:16,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:39:16,134 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 82 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:16,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 122 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 21:39:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2022-10-15 21:39:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-10-15 21:39:16,143 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 36 [2022-10-15 21:39:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:16,143 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-10-15 21:39:16,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-15 21:39:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-10-15 21:39:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 21:39:16,144 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:16,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:16,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:16,360 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,SelfDestructingSolverStorable15 [2022-10-15 21:39:16,361 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1042700209, now seen corresponding path program 1 times [2022-10-15 21:39:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605243238] [2022-10-15 21:39:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:39:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605243238] [2022-10-15 21:39:16,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605243238] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445800962] [2022-10-15 21:39:16,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:16,650 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:16,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 21:39:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:16,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:39:16,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:39:16,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:39:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:39:16,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445800962] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:39:16,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:39:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 10 [2022-10-15 21:39:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18919833] [2022-10-15 21:39:16,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:39:16,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 21:39:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 21:39:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:39:16,943 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:39:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:17,163 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-10-15 21:39:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 21:39:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-10-15 21:39:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:17,165 INFO L225 Difference]: With dead ends: 126 [2022-10-15 21:39:17,165 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 21:39:17,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:39:17,166 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 137 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:17,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 209 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 21:39:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2022-10-15 21:39:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.169811320754717) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-10-15 21:39:17,175 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 41 [2022-10-15 21:39:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:17,175 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-10-15 21:39:17,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:39:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-10-15 21:39:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 21:39:17,176 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:17,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:17,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:17,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 21:39:17,391 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1787948312, now seen corresponding path program 1 times [2022-10-15 21:39:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:17,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662240639] [2022-10-15 21:39:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:17,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:39:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662240639] [2022-10-15 21:39:17,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662240639] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349790627] [2022-10-15 21:39:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:17,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:17,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:17,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 21:39:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:17,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:39:17,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:39:17,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:39:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:39:17,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349790627] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:39:17,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:39:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2022-10-15 21:39:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552115502] [2022-10-15 21:39:17,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:39:17,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:39:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:39:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:17,809 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:39:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:17,944 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-10-15 21:39:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:39:17,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-10-15 21:39:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:17,946 INFO L225 Difference]: With dead ends: 100 [2022-10-15 21:39:17,946 INFO L226 Difference]: Without dead ends: 79 [2022-10-15 21:39:17,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:39:17,947 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 145 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:17,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 176 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-15 21:39:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2022-10-15 21:39:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-10-15 21:39:17,955 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 44 [2022-10-15 21:39:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:17,956 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-10-15 21:39:17,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:39:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-10-15 21:39:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 21:39:17,957 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:17,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:17,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:18,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 21:39:18,172 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1848906523, now seen corresponding path program 1 times [2022-10-15 21:39:18,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:18,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276456382] [2022-10-15 21:39:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 21:39:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:18,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276456382] [2022-10-15 21:39:18,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276456382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:18,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:18,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:39:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424764908] [2022-10-15 21:39:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:18,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:39:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:39:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:18,312 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-15 21:39:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:18,390 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-10-15 21:39:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:39:18,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 45 [2022-10-15 21:39:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:18,392 INFO L225 Difference]: With dead ends: 65 [2022-10-15 21:39:18,392 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 21:39:18,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:18,393 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:18,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 21:39:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-10-15 21:39:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-10-15 21:39:18,401 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 45 [2022-10-15 21:39:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:18,402 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-10-15 21:39:18,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-15 21:39:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-10-15 21:39:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 21:39:18,402 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:18,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 21:39:18,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1497431189, now seen corresponding path program 2 times [2022-10-15 21:39:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:18,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079486480] [2022-10-15 21:39:18,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:18,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:39:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079486480] [2022-10-15 21:39:18,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079486480] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071487373] [2022-10-15 21:39:18,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:39:18,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:18,615 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:18,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 21:39:18,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 21:39:18,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:39:18,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:39:18,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:39:18,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071487373] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:18,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:18,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-15 21:39:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657852900] [2022-10-15 21:39:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:18,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:39:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:39:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:39:18,818 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-15 21:39:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:18,906 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-10-15 21:39:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:39:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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 53 [2022-10-15 21:39:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:18,907 INFO L225 Difference]: With dead ends: 76 [2022-10-15 21:39:18,907 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 21:39:18,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:39:18,908 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 82 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:18,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 140 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 21:39:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2022-10-15 21:39:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-10-15 21:39:18,916 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 53 [2022-10-15 21:39:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:18,917 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-10-15 21:39:18,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-15 21:39:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-10-15 21:39:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-15 21:39:18,918 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:18,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:18,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:19,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:19,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash 824273525, now seen corresponding path program 1 times [2022-10-15 21:39:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:19,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870334158] [2022-10-15 21:39:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:39:19,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:19,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870334158] [2022-10-15 21:39:19,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870334158] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:19,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:19,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:39:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411384461] [2022-10-15 21:39:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:19,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:39:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:19,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:39:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:39:19,225 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-15 21:39:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:19,252 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-10-15 21:39:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:39:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 54 [2022-10-15 21:39:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:19,253 INFO L225 Difference]: With dead ends: 66 [2022-10-15 21:39:19,253 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 21:39:19,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:39:19,254 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:19,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 21:39:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 21:39:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-10-15 21:39:19,265 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 54 [2022-10-15 21:39:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:19,266 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-10-15 21:39:19,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-15 21:39:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-10-15 21:39:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 21:39:19,267 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:19,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:19,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-15 21:39:19,267 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1553151706, now seen corresponding path program 1 times [2022-10-15 21:39:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:19,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123716590] [2022-10-15 21:39:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:39:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:19,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123716590] [2022-10-15 21:39:19,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123716590] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:19,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324152807] [2022-10-15 21:39:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:19,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:19,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:19,488 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:19,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 21:39:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:19,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:39:19,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:39:19,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:19,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324152807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:19,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:19,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-15 21:39:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228771676] [2022-10-15 21:39:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:19,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:19,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:19,776 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-15 21:39:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:19,853 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-10-15 21:39:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:39:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 57 [2022-10-15 21:39:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:19,855 INFO L225 Difference]: With dead ends: 90 [2022-10-15 21:39:19,855 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 21:39:19,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:39:19,858 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:19,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 21:39:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-10-15 21:39:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-10-15 21:39:19,870 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 57 [2022-10-15 21:39:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:19,870 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-10-15 21:39:19,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-15 21:39:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-10-15 21:39:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 21:39:19,872 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:19,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:19,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:20,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-15 21:39:20,087 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1842699814, now seen corresponding path program 1 times [2022-10-15 21:39:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151176822] [2022-10-15 21:39:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:39:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:20,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151176822] [2022-10-15 21:39:20,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151176822] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:20,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483067900] [2022-10-15 21:39:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:20,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:20,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:20,305 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:20,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 21:39:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:39:20,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:39:20,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:39:20,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483067900] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:20,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:39:20,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-10-15 21:39:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139310646] [2022-10-15 21:39:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:20,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:20,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:39:20,553 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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-15 21:39:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:20,602 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-10-15 21:39:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:39:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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 60 [2022-10-15 21:39:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:20,604 INFO L225 Difference]: With dead ends: 66 [2022-10-15 21:39:20,604 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 21:39:20,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:39:20,605 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:20,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 21:39:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 21:39:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-10-15 21:39:20,618 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 60 [2022-10-15 21:39:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:20,619 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-10-15 21:39:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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-15 21:39:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-10-15 21:39:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-15 21:39:20,627 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:20,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:20,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:20,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:20,844 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1289119531, now seen corresponding path program 1 times [2022-10-15 21:39:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:20,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546217025] [2022-10-15 21:39:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:39:20,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:20,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546217025] [2022-10-15 21:39:20,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546217025] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:39:20,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:39:20,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:39:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466189400] [2022-10-15 21:39:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:39:20,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:39:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:39:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:39:20,948 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-15 21:39:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:21,001 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-10-15 21:39:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:39:21,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 61 [2022-10-15 21:39:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:21,002 INFO L225 Difference]: With dead ends: 64 [2022-10-15 21:39:21,002 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 21:39:21,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:39:21,003 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:21,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:39:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 21:39:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-15 21:39:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:39:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-10-15 21:39:21,012 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 61 [2022-10-15 21:39:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:21,012 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-10-15 21:39:21,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-15 21:39:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-10-15 21:39:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-15 21:39:21,014 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:39:21,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:21,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-15 21:39:21,014 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:39:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:39:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1539549640, now seen corresponding path program 1 times [2022-10-15 21:39:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:39:21,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494051573] [2022-10-15 21:39:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:39:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:39:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:21,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:39:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:39:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:39:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494051573] [2022-10-15 21:39:21,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494051573] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:39:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473205013] [2022-10-15 21:39:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:39:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:21,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:39:21,275 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:39:21,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-15 21:39:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:39:21,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:39:21,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:39:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:39:21,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:39:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:39:21,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473205013] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:39:21,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:39:21,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2022-10-15 21:39:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312875779] [2022-10-15 21:39:21,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:39:21,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:39:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:39:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:39:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:39:21,648 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:39:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:39:21,816 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-10-15 21:39:21,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:39:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2022-10-15 21:39:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:39:21,818 INFO L225 Difference]: With dead ends: 79 [2022-10-15 21:39:21,818 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:39:21,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:39:21,819 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:39:21,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 180 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:39:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:39:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:39:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:39:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:39:21,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2022-10-15 21:39:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:39:21,821 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:39:21,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:39:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:39:21,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:39:21,824 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-10-15 21:39:21,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-10-15 21:39:21,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-10-15 21:39:21,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-10-15 21:39:21,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-10-15 21:39:21,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-10-15 21:39:21,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-10-15 21:39:21,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-10-15 21:39:21,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-10-15 21:39:21,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-10-15 21:39:21,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-10-15 21:39:21,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-10-15 21:39:21,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-10-15 21:39:21,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-10-15 21:39:21,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-10-15 21:39:21,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-10-15 21:39:21,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-10-15 21:39:21,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-10-15 21:39:21,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-15 21:39:22,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:39:22,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:39:25,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,386 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-10-15 21:39:25,386 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-10-15 21:39:25,386 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2022-10-15 21:39:25,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-10-15 21:39:25,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-10-15 21:39:25,387 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)))) [2022-10-15 21:39:25,387 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2022-10-15 21:39:25,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-10-15 21:39:25,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-10-15 21:39:25,389 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1))) (or (and .cse0 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 1)))) [2022-10-15 21:39:25,389 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-10-15 21:39:25,389 INFO L902 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: true [2022-10-15 21:39:25,389 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,389 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L625(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L625-1(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L625-5(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,390 INFO L899 garLoopResultBuilder]: For program point L625-6(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,391 INFO L895 garLoopResultBuilder]: At program point L625-7(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1))) (or (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse1) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) .cse0 .cse1))) [2022-10-15 21:39:25,391 INFO L899 garLoopResultBuilder]: For program point L625-8(lines 625 628) no Hoare annotation was computed. [2022-10-15 21:39:25,391 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-10-15 21:39:25,391 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-10-15 21:39:25,391 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-10-15 21:39:25,392 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-10-15 21:39:25,392 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2022-10-15 21:39:25,392 INFO L895 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) [2022-10-15 21:39:25,392 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2022-10-15 21:39:25,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,392 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:39:25,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-10-15 21:39:25,393 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-10-15 21:39:25,393 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (or (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|))) [2022-10-15 21:39:25,393 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2022-10-15 21:39:25,393 INFO L895 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 1)) [2022-10-15 21:39:25,393 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:39:25,393 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-10-15 21:39:25,393 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-10-15 21:39:25,394 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-10-15 21:39:25,394 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-10-15 21:39:25,394 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-10-15 21:39:25,394 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-10-15 21:39:25,394 INFO L899 garLoopResultBuilder]: For program point L629(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,394 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-10-15 21:39:25,395 INFO L899 garLoopResultBuilder]: For program point L629-3(lines 629 634) no Hoare annotation was computed. [2022-10-15 21:39:25,395 INFO L899 garLoopResultBuilder]: For program point L629-4(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,395 INFO L899 garLoopResultBuilder]: For program point L629-5(line 629) no Hoare annotation was computed. [2022-10-15 21:39:25,395 INFO L895 garLoopResultBuilder]: At program point L629-6(lines 629 634) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1))) (or (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) .cse0 .cse1 .cse2))) [2022-10-15 21:39:25,395 INFO L899 garLoopResultBuilder]: For program point L629-7(lines 629 634) no Hoare annotation was computed. [2022-10-15 21:39:25,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-10-15 21:39:25,396 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-10-15 21:39:25,396 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2022-10-15 21:39:25,396 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-10-15 21:39:25,396 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-10-15 21:39:25,396 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-10-15 21:39:25,396 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-10-15 21:39:25,396 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2022-10-15 21:39:25,397 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-10-15 21:39:25,401 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:39:25,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:39:25,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:39:25 BoogieIcfgContainer [2022-10-15 21:39:25,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:39:25,426 INFO L158 Benchmark]: Toolchain (without parser) took 19285.07ms. Allocated memory was 153.1MB in the beginning and 337.6MB in the end (delta: 184.5MB). Free memory was 126.6MB in the beginning and 280.2MB in the end (delta: -153.5MB). Peak memory consumption was 203.2MB. Max. memory is 8.0GB. [2022-10-15 21:39:25,426 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:39:25,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.59ms. Allocated memory is still 153.1MB. Free memory was 126.4MB in the beginning and 109.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 21:39:25,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.40ms. Allocated memory is still 153.1MB. Free memory was 109.7MB in the beginning and 107.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:39:25,427 INFO L158 Benchmark]: Boogie Preprocessor took 57.71ms. Allocated memory is still 153.1MB. Free memory was 107.4MB in the beginning and 105.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:39:25,427 INFO L158 Benchmark]: RCFGBuilder took 786.57ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 125.9MB in the end (delta: -20.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-10-15 21:39:25,428 INFO L158 Benchmark]: TraceAbstraction took 17617.51ms. Allocated memory was 153.1MB in the beginning and 337.6MB in the end (delta: 184.5MB). Free memory was 125.4MB in the beginning and 280.2MB in the end (delta: -154.7MB). Peak memory consumption was 202.3MB. Max. memory is 8.0GB. [2022-10-15 21:39:25,429 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.29ms. Allocated memory is still 153.1MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 749.59ms. Allocated memory is still 153.1MB. Free memory was 126.4MB in the beginning and 109.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.40ms. Allocated memory is still 153.1MB. Free memory was 109.7MB in the beginning and 107.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.71ms. Allocated memory is still 153.1MB. Free memory was 107.4MB in the beginning and 105.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 786.57ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 125.9MB in the end (delta: -20.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * TraceAbstraction took 17617.51ms. Allocated memory was 153.1MB in the beginning and 337.6MB in the end (delta: 184.5MB). Free memory was 125.4MB in the beginning and 280.2MB in the end (delta: -154.7MB). Peak memory consumption was 202.3MB. 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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1440 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1437 mSDsluCounter, 3520 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2342 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1275 IncrementalHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 1178 mSDtfsCounter, 1275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 984 GetRequests, 811 SyntacticMatches, 14 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=16, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 228 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 241 HoareAnnotationTreeSize, 18 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 14 FomulaSimplificationsInter, 125034 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1486 NumberOfCodeBlocks, 1457 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1594 ConstructedInterpolants, 0 QuantifiedInterpolants, 4349 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3911 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 43 InterpolantComputations, 22 PerfectInterpolantSequences, 448/479 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((2 <= len && index <= 0) && len <= 2) && index <= 0) && 0 <= i) && len <= 1) && i <= 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: ((2 <= len && len <= 2) && len <= 1) || (2 == len && len == len) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((((2 <= len && index <= 0) && i <= 0) && len <= 2) && index <= 0) && len <= 1) || ((((1 <= i && i + 1 <= len) && len <= 2) && index <= 0) && len <= 1) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((2 <= len && i <= 0) && len <= 2) && index <= 0) && len <= 1) || (((1 <= i && i + 1 <= len) && len <= 2) && len <= 1) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: (((((2 <= len && 1 <= i) && index <= 1) && len <= 2) && len <= 1) && i <= 1) || (((((2 <= len && len <= 2) && 0 <= i) && len <= 1) && i <= 1) && i == index) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (2 <= len && len <= 2) && len <= 1 - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((((((2 <= len && index <= 0) && i <= 0) && len <= 2) && index <= 0) && 0 <= i) && len <= 1) || (((((((2 <= len && 1 <= i) && len <= 2) && index <= 0) && 0 <= i) && len <= 1) && index <= 1) && i <= 1) RESULT: Ultimate proved your program to be correct! [2022-10-15 21:39:25,492 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...