/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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:52:21,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:52:21,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:52:21,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:52:21,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:52:21,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:52:21,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:52:21,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:52:21,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:52:21,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:52:21,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:52:21,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:52:21,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:52:21,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:52:21,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:52:21,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:52:21,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:52:21,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:52:21,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:52:21,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:52:21,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:52:21,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:52:21,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:52:21,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:52:21,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:52:21,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:52:21,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:52:21,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:52:21,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:52:21,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:52:21,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:52:21,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:52:21,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:52:21,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:52:21,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:52:21,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:52:21,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:52:21,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:52:21,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:52:21,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:52:21,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:52:21,439 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:52:21,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:52:21,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:52:21,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:52:21,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:52:21,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:52:21,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:52:21,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:52:21,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:52:21,507 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:52:21,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:52:21,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:52:21,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:52:21,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:52:21,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:52:21,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:52:21,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:52:21,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:52:21,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:52:21,510 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:52:21,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:52:21,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:52:21,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:52:21,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:52:21,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:52:21,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:52:21,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:52:21,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:52:21,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:52:21,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:52:21,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:52:21,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:52:21,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:52:21,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:52:21,514 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:52:21,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:52:22,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:52:22,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:52:22,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:52:22,022 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:52:22,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:22,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3b719e5/6fe49d53079f4970a685f3acf4a391dc/FLAGe083b9322 [2022-10-15 21:52:22,847 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:52:22,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:22,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3b719e5/6fe49d53079f4970a685f3acf4a391dc/FLAGe083b9322 [2022-10-15 21:52:23,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3b719e5/6fe49d53079f4970a685f3acf4a391dc [2022-10-15 21:52:23,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:52:23,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:52:23,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:52:23,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:52:23,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:52:23,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f7c7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23, skipping insertion in model container [2022-10-15 21:52:23,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:52:23,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:52:23,545 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2022-10-15 21:52:23,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:52:23,558 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:52:23,689 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2022-10-15 21:52:23,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:52:23,723 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:52:23,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23 WrapperNode [2022-10-15 21:52:23,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:52:23,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:52:23,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:52:23,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:52:23,734 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:52:23" (1/1) ... [2022-10-15 21:52:23,763 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:52:23" (1/1) ... [2022-10-15 21:52:23,810 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 411 [2022-10-15 21:52:23,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:52:23,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:52:23,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:52:23,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:52:23,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,905 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:52:23,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:52:23,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:52:23,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:52:23,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (1/1) ... [2022-10-15 21:52:23,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:52:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:23,984 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:52:24,004 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:52:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:52:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-10-15 21:52:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-10-15 21:52:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-10-15 21:52:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-10-15 21:52:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-10-15 21:52:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-10-15 21:52:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-10-15 21:52:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-10-15 21:52:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-10-15 21:52:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-10-15 21:52:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:52:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:52:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:52:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:52:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:52:24,183 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:52:24,186 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:52:24,981 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:52:25,010 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:52:25,011 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 21:52:25,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:52:25 BoogieIcfgContainer [2022-10-15 21:52:25,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:52:25,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:52:25,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:52:25,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:52:25,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:52:23" (1/3) ... [2022-10-15 21:52:25,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c8e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:52:25, skipping insertion in model container [2022-10-15 21:52:25,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:23" (2/3) ... [2022-10-15 21:52:25,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c8e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:52:25, skipping insertion in model container [2022-10-15 21:52:25,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:52:25" (3/3) ... [2022-10-15 21:52:25,031 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:25,056 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:52:25,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 21:52:25,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:52:25,168 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;@1a0d71a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:52:25,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 21:52:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 150 states have (on average 1.6066666666666667) internal successors, (241), 162 states have internal predecessors, (241), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-10-15 21:52:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 21:52:25,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:25,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:25,187 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash 810794579, now seen corresponding path program 1 times [2022-10-15 21:52:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:25,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785859601] [2022-10-15 21:52:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:25,477 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:52:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:25,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785859601] [2022-10-15 21:52:25,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785859601] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:25,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:25,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:52:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813349745] [2022-10-15 21:52:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:25,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:25,531 INFO L87 Difference]: Start difference. First operand has 202 states, 150 states have (on average 1.6066666666666667) internal successors, (241), 162 states have internal predecessors, (241), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:52:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:25,689 INFO L93 Difference]: Finished difference Result 421 states and 694 transitions. [2022-10-15 21:52:25,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:25,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 21:52:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:25,709 INFO L225 Difference]: With dead ends: 421 [2022-10-15 21:52:25,709 INFO L226 Difference]: Without dead ends: 221 [2022-10-15 21:52:25,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:52:25,723 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 37 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:25,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 905 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-15 21:52:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2022-10-15 21:52:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 161 states have (on average 1.5590062111801242) internal successors, (251), 172 states have internal predecessors, (251), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-10-15 21:52:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2022-10-15 21:52:25,805 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 11 [2022-10-15 21:52:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:25,806 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2022-10-15 21:52:25,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:52:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2022-10-15 21:52:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 21:52:25,809 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:25,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:25,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:52:25,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1173192824, now seen corresponding path program 1 times [2022-10-15 21:52:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:25,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916329343] [2022-10-15 21:52:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:25,958 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:52:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916329343] [2022-10-15 21:52:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916329343] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:25,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:25,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:52:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695558638] [2022-10-15 21:52:25,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:25,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:25,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:25,964 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:52:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:26,026 INFO L93 Difference]: Finished difference Result 451 states and 699 transitions. [2022-10-15 21:52:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-10-15 21:52:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:26,033 INFO L225 Difference]: With dead ends: 451 [2022-10-15 21:52:26,033 INFO L226 Difference]: Without dead ends: 249 [2022-10-15 21:52:26,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:52:26,040 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:26,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 911 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-15 21:52:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2022-10-15 21:52:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 187 states have (on average 1.5294117647058822) internal successors, (286), 198 states have internal predecessors, (286), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:52:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2022-10-15 21:52:26,080 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 16 [2022-10-15 21:52:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:26,081 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2022-10-15 21:52:26,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:52:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2022-10-15 21:52:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:52:26,085 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:26,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:26,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:52:26,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1790921203, now seen corresponding path program 1 times [2022-10-15 21:52:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:26,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307624191] [2022-10-15 21:52:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:52:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307624191] [2022-10-15 21:52:26,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307624191] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:26,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:26,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:52:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343978869] [2022-10-15 21:52:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:26,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:26,326 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:52:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:26,376 INFO L93 Difference]: Finished difference Result 249 states and 378 transitions. [2022-10-15 21:52:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-10-15 21:52:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:26,381 INFO L225 Difference]: With dead ends: 249 [2022-10-15 21:52:26,381 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 21:52:26,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:52:26,384 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 23 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:26,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 868 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 21:52:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2022-10-15 21:52:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 197 states have internal predecessors, (283), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:52:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 369 transitions. [2022-10-15 21:52:26,416 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 369 transitions. Word has length 29 [2022-10-15 21:52:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:26,416 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 369 transitions. [2022-10-15 21:52:26,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:52:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 369 transitions. [2022-10-15 21:52:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:52:26,425 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:26,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:26,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:52:26,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 316018114, now seen corresponding path program 1 times [2022-10-15 21:52:26,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:26,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181736353] [2022-10-15 21:52:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:26,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:52:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:26,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181736353] [2022-10-15 21:52:26,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181736353] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:26,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034962765] [2022-10-15 21:52:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:26,660 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:52:26,669 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:52:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:26,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:52:26,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:26,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034962765] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:26,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:26,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 21:52:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373869035] [2022-10-15 21:52:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:26,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:52:26,933 INFO L87 Difference]: Start difference. First operand 244 states and 369 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:52:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:27,007 INFO L93 Difference]: Finished difference Result 248 states and 375 transitions. [2022-10-15 21:52:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:52:27,008 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), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-10-15 21:52:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:27,011 INFO L225 Difference]: With dead ends: 248 [2022-10-15 21:52:27,012 INFO L226 Difference]: Without dead ends: 247 [2022-10-15 21:52:27,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:27,014 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 42 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:27,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1548 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-10-15 21:52:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2022-10-15 21:52:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 163 states have (on average 1.5153374233128833) internal successors, (247), 172 states have internal predecessors, (247), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-10-15 21:52:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 323 transitions. [2022-10-15 21:52:27,044 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 323 transitions. Word has length 30 [2022-10-15 21:52:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:27,045 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 323 transitions. [2022-10-15 21:52:27,045 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), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:52:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 323 transitions. [2022-10-15 21:52:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-15 21:52:27,059 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:27,059 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:27,086 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:52:27,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:27,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -621892198, now seen corresponding path program 1 times [2022-10-15 21:52:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608709856] [2022-10-15 21:52:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-15 21:52:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 21:52:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 21:52:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 21:52:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 21:52:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-15 21:52:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 21:52:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:27,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608709856] [2022-10-15 21:52:27,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608709856] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:27,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794830740] [2022-10-15 21:52:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:27,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:27,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:27,542 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:52:27,545 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:52:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:27,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:52:27,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:27,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794830740] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:27,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:27,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477524923] [2022-10-15 21:52:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:27,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:27,740 INFO L87 Difference]: Start difference. First operand 214 states and 323 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:27,804 INFO L93 Difference]: Finished difference Result 375 states and 574 transitions. [2022-10-15 21:52:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2022-10-15 21:52:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:27,808 INFO L225 Difference]: With dead ends: 375 [2022-10-15 21:52:27,808 INFO L226 Difference]: Without dead ends: 221 [2022-10-15 21:52:27,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:27,813 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 20 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:27,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 865 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-15 21:52:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-10-15 21:52:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 178 states have internal predecessors, (255), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-10-15 21:52:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 333 transitions. [2022-10-15 21:52:27,852 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 333 transitions. Word has length 97 [2022-10-15 21:52:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:27,854 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 333 transitions. [2022-10-15 21:52:27,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 333 transitions. [2022-10-15 21:52:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-15 21:52:27,860 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:27,860 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,906 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:52:28,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:28,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -954503880, now seen corresponding path program 1 times [2022-10-15 21:52:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:28,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787531079] [2022-10-15 21:52:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-15 21:52:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:52:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 21:52:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:52:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-15 21:52:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-15 21:52:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787531079] [2022-10-15 21:52:28,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787531079] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095972711] [2022-10-15 21:52:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:28,383 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:52:28,398 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:52:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:28,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 21:52:28,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:28,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095972711] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:28,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:28,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363721118] [2022-10-15 21:52:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:28,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:28,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:28,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:28,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:28,572 INFO L87 Difference]: Start difference. First operand 221 states and 333 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:28,632 INFO L93 Difference]: Finished difference Result 389 states and 593 transitions. [2022-10-15 21:52:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:28,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-10-15 21:52:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:28,636 INFO L225 Difference]: With dead ends: 389 [2022-10-15 21:52:28,636 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 21:52:28,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:28,638 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 18 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:28,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 865 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 21:52:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-10-15 21:52:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.5202312138728324) internal successors, (263), 184 states have internal predecessors, (263), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-10-15 21:52:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 343 transitions. [2022-10-15 21:52:28,655 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 343 transitions. Word has length 99 [2022-10-15 21:52:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:28,655 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 343 transitions. [2022-10-15 21:52:28,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 343 transitions. [2022-10-15 21:52:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-15 21:52:28,658 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:28,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:28,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 21:52:28,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:28,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash -131811894, now seen corresponding path program 1 times [2022-10-15 21:52:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:28,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777754442] [2022-10-15 21:52:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-15 21:52:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:52:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-15 21:52:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-15 21:52:29,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777754442] [2022-10-15 21:52:29,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777754442] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243706705] [2022-10-15 21:52:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:29,103 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:52:29,127 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:52:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:29,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-10-15 21:52:29,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:29,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243706705] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:29,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:29,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175163184] [2022-10-15 21:52:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:29,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:29,309 INFO L87 Difference]: Start difference. First operand 228 states and 343 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:29,408 INFO L93 Difference]: Finished difference Result 410 states and 631 transitions. [2022-10-15 21:52:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-10-15 21:52:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:29,414 INFO L225 Difference]: With dead ends: 410 [2022-10-15 21:52:29,414 INFO L226 Difference]: Without dead ends: 242 [2022-10-15 21:52:29,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:29,419 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 57 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:29,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 810 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-10-15 21:52:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-10-15 21:52:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 185 states have (on average 1.5351351351351352) internal successors, (284), 196 states have internal predecessors, (284), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-10-15 21:52:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 366 transitions. [2022-10-15 21:52:29,459 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 366 transitions. Word has length 100 [2022-10-15 21:52:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:29,459 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 366 transitions. [2022-10-15 21:52:29,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 366 transitions. [2022-10-15 21:52:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-15 21:52:29,463 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:29,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:29,503 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:52:29,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:29,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -224412949, now seen corresponding path program 1 times [2022-10-15 21:52:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:29,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047918465] [2022-10-15 21:52:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-15 21:52:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-15 21:52:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 21:52:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:29,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047918465] [2022-10-15 21:52:29,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047918465] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:29,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258208161] [2022-10-15 21:52:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:29,878 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:52:29,886 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:52:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:30,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-15 21:52:30,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:30,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258208161] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:30,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:30,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330195898] [2022-10-15 21:52:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:30,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:30,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:30,067 INFO L87 Difference]: Start difference. First operand 242 states and 366 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:30,158 INFO L93 Difference]: Finished difference Result 489 states and 755 transitions. [2022-10-15 21:52:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:30,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2022-10-15 21:52:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:30,161 INFO L225 Difference]: With dead ends: 489 [2022-10-15 21:52:30,162 INFO L226 Difference]: Without dead ends: 266 [2022-10-15 21:52:30,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:30,164 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 53 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:30,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 818 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-10-15 21:52:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-10-15 21:52:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 205 states have (on average 1.551219512195122) internal successors, (318), 216 states have internal predecessors, (318), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:52:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 404 transitions. [2022-10-15 21:52:30,181 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 404 transitions. Word has length 103 [2022-10-15 21:52:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:30,181 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 404 transitions. [2022-10-15 21:52:30,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2022-10-15 21:52:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-10-15 21:52:30,184 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:30,184 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,234 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:52:30,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:30,399 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1513766647, now seen corresponding path program 1 times [2022-10-15 21:52:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:30,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069077359] [2022-10-15 21:52:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-15 21:52:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-15 21:52:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069077359] [2022-10-15 21:52:30,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069077359] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204719922] [2022-10-15 21:52:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:30,573 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:52:30,578 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:52:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:30,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 21:52:30,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:30,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204719922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:30,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:30,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142532604] [2022-10-15 21:52:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:30,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:30,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:30,751 INFO L87 Difference]: Start difference. First operand 266 states and 404 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:30,831 INFO L93 Difference]: Finished difference Result 533 states and 820 transitions. [2022-10-15 21:52:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:30,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2022-10-15 21:52:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:30,835 INFO L225 Difference]: With dead ends: 533 [2022-10-15 21:52:30,835 INFO L226 Difference]: Without dead ends: 286 [2022-10-15 21:52:30,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:30,837 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 47 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:30,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 814 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-10-15 21:52:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-10-15 21:52:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5565610859728507) internal successors, (344), 232 states have internal predecessors, (344), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-10-15 21:52:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 434 transitions. [2022-10-15 21:52:30,854 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 434 transitions. Word has length 105 [2022-10-15 21:52:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:30,854 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 434 transitions. [2022-10-15 21:52:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 434 transitions. [2022-10-15 21:52:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-15 21:52:30,857 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:30,858 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,897 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:52:31,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,072 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1484764121, now seen corresponding path program 1 times [2022-10-15 21:52:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:31,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449683655] [2022-10-15 21:52:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-15 21:52:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449683655] [2022-10-15 21:52:31,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449683655] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924697443] [2022-10-15 21:52:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:31,262 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:52:31,285 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:52:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:31,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 21:52:31,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:31,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924697443] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:31,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:31,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086653048] [2022-10-15 21:52:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:31,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:31,427 INFO L87 Difference]: Start difference. First operand 286 states and 434 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:31,479 INFO L93 Difference]: Finished difference Result 550 states and 841 transitions. [2022-10-15 21:52:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2022-10-15 21:52:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:31,483 INFO L225 Difference]: With dead ends: 550 [2022-10-15 21:52:31,483 INFO L226 Difference]: Without dead ends: 354 [2022-10-15 21:52:31,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:31,485 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 90 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:31,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1091 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-10-15 21:52:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 296. [2022-10-15 21:52:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.5521739130434782) internal successors, (357), 240 states have internal predecessors, (357), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 451 transitions. [2022-10-15 21:52:31,504 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 451 transitions. Word has length 106 [2022-10-15 21:52:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:31,505 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 451 transitions. [2022-10-15 21:52:31,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 451 transitions. [2022-10-15 21:52:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-15 21:52:31,508 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:31,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:31,549 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:52:31,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1216952152, now seen corresponding path program 1 times [2022-10-15 21:52:31,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:31,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943764352] [2022-10-15 21:52:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-15 21:52:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943764352] [2022-10-15 21:52:31,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943764352] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502891383] [2022-10-15 21:52:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:31,889 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:52:31,914 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:52:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:32,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 21:52:32,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502891383] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:32,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:32,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731982088] [2022-10-15 21:52:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:32,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:32,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:32,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:32,056 INFO L87 Difference]: Start difference. First operand 296 states and 451 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:32,109 INFO L93 Difference]: Finished difference Result 386 states and 599 transitions. [2022-10-15 21:52:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-10-15 21:52:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:32,113 INFO L225 Difference]: With dead ends: 386 [2022-10-15 21:52:32,114 INFO L226 Difference]: Without dead ends: 385 [2022-10-15 21:52:32,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:32,115 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 115 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:32,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1137 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-10-15 21:52:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 295. [2022-10-15 21:52:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.5478260869565217) internal successors, (356), 239 states have internal predecessors, (356), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 450 transitions. [2022-10-15 21:52:32,150 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 450 transitions. Word has length 107 [2022-10-15 21:52:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:32,151 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 450 transitions. [2022-10-15 21:52:32,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 450 transitions. [2022-10-15 21:52:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-10-15 21:52:32,154 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:32,154 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:32,196 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:52:32,368 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,SelfDestructingSolverStorable10 [2022-10-15 21:52:32,369 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1458310361, now seen corresponding path program 1 times [2022-10-15 21:52:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:32,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008646795] [2022-10-15 21:52:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:52:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008646795] [2022-10-15 21:52:32,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008646795] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450160712] [2022-10-15 21:52:32,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:32,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:32,548 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:52:32,570 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:52:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:32,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:32,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:32,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450160712] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:32,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:32,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157173625] [2022-10-15 21:52:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:32,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:32,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:32,720 INFO L87 Difference]: Start difference. First operand 295 states and 450 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:32,769 INFO L93 Difference]: Finished difference Result 353 states and 541 transitions. [2022-10-15 21:52:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2022-10-15 21:52:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:32,773 INFO L225 Difference]: With dead ends: 353 [2022-10-15 21:52:32,773 INFO L226 Difference]: Without dead ends: 352 [2022-10-15 21:52:32,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:32,775 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 85 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1052 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:52:32,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1052 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-10-15 21:52:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 296. [2022-10-15 21:52:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 240 states have internal predecessors, (357), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 451 transitions. [2022-10-15 21:52:32,793 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 451 transitions. Word has length 114 [2022-10-15 21:52:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:32,793 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 451 transitions. [2022-10-15 21:52:32,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 451 transitions. [2022-10-15 21:52:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-15 21:52:32,797 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:32,797 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:32,839 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:52:33,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2037019430, now seen corresponding path program 1 times [2022-10-15 21:52:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:33,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669303065] [2022-10-15 21:52:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:52:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:33,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669303065] [2022-10-15 21:52:33,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669303065] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:33,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383674450] [2022-10-15 21:52:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:33,197 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:52:33,208 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:52:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:33,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:33,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:33,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383674450] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:33,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:33,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979054801] [2022-10-15 21:52:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:33,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:33,391 INFO L87 Difference]: Start difference. First operand 296 states and 451 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:33,455 INFO L93 Difference]: Finished difference Result 388 states and 601 transitions. [2022-10-15 21:52:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2022-10-15 21:52:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:33,460 INFO L225 Difference]: With dead ends: 388 [2022-10-15 21:52:33,460 INFO L226 Difference]: Without dead ends: 387 [2022-10-15 21:52:33,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:33,462 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 113 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:33,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1149 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-10-15 21:52:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 297. [2022-10-15 21:52:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.543103448275862) internal successors, (358), 241 states have internal predecessors, (358), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 452 transitions. [2022-10-15 21:52:33,484 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 452 transitions. Word has length 115 [2022-10-15 21:52:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:33,485 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 452 transitions. [2022-10-15 21:52:33,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 452 transitions. [2022-10-15 21:52:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-15 21:52:33,489 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:33,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:33,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-10-15 21:52:33,702 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,SelfDestructingSolverStorable12 [2022-10-15 21:52:33,702 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1173170251, now seen corresponding path program 1 times [2022-10-15 21:52:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:33,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779851887] [2022-10-15 21:52:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:52:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:33,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:33,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779851887] [2022-10-15 21:52:33,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779851887] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:33,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290154591] [2022-10-15 21:52:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:33,896 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:52:33,915 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:52:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:34,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:34,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:34,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290154591] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:34,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:34,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375008331] [2022-10-15 21:52:34,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:34,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:34,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:34,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:34,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:34,093 INFO L87 Difference]: Start difference. First operand 297 states and 452 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:34,228 INFO L93 Difference]: Finished difference Result 647 states and 1001 transitions. [2022-10-15 21:52:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:52:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2022-10-15 21:52:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:34,232 INFO L225 Difference]: With dead ends: 647 [2022-10-15 21:52:34,233 INFO L226 Difference]: Without dead ends: 440 [2022-10-15 21:52:34,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:34,235 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 195 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:34,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 2139 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-10-15 21:52:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 302. [2022-10-15 21:52:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 237 states have (on average 1.5443037974683544) internal successors, (366), 245 states have internal predecessors, (366), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 462 transitions. [2022-10-15 21:52:34,255 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 462 transitions. Word has length 116 [2022-10-15 21:52:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:34,256 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 462 transitions. [2022-10-15 21:52:34,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 462 transitions. [2022-10-15 21:52:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-10-15 21:52:34,259 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:34,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:34,298 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:52:34,472 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,SelfDestructingSolverStorable13 [2022-10-15 21:52:34,472 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2008539778, now seen corresponding path program 1 times [2022-10-15 21:52:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:34,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984149208] [2022-10-15 21:52:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:52:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:34,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984149208] [2022-10-15 21:52:34,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984149208] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:34,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487785654] [2022-10-15 21:52:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:34,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:34,653 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:52:34,674 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:52:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:34,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:34,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:34,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487785654] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:34,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:34,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120663794] [2022-10-15 21:52:34,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:34,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:34,885 INFO L87 Difference]: Start difference. First operand 302 states and 462 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:35,032 INFO L93 Difference]: Finished difference Result 447 states and 698 transitions. [2022-10-15 21:52:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:52:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-10-15 21:52:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:35,038 INFO L225 Difference]: With dead ends: 447 [2022-10-15 21:52:35,038 INFO L226 Difference]: Without dead ends: 446 [2022-10-15 21:52:35,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:35,040 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 297 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:35,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1697 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-10-15 21:52:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 299. [2022-10-15 21:52:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 235 states have (on average 1.5446808510638297) internal successors, (363), 242 states have internal predecessors, (363), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 459 transitions. [2022-10-15 21:52:35,063 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 459 transitions. Word has length 117 [2022-10-15 21:52:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:35,063 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 459 transitions. [2022-10-15 21:52:35,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 459 transitions. [2022-10-15 21:52:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-10-15 21:52:35,067 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:35,067 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:35,118 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:52:35,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 21:52:35,283 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1596442037, now seen corresponding path program 1 times [2022-10-15 21:52:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:35,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313478560] [2022-10-15 21:52:35,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:52:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-15 21:52:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:35,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313478560] [2022-10-15 21:52:35,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313478560] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501757745] [2022-10-15 21:52:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:35,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:35,466 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:52:35,491 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:52:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:35,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:35,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:35,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501757745] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:35,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969855300] [2022-10-15 21:52:35,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:35,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:35,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:35,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:35,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:35,650 INFO L87 Difference]: Start difference. First operand 299 states and 459 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:35,699 INFO L93 Difference]: Finished difference Result 356 states and 549 transitions. [2022-10-15 21:52:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2022-10-15 21:52:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:35,703 INFO L225 Difference]: With dead ends: 356 [2022-10-15 21:52:35,703 INFO L226 Difference]: Without dead ends: 355 [2022-10-15 21:52:35,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:35,705 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 82 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:35,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1035 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-10-15 21:52:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 300. [2022-10-15 21:52:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 236 states have (on average 1.5423728813559323) internal successors, (364), 243 states have internal predecessors, (364), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 460 transitions. [2022-10-15 21:52:35,724 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 460 transitions. Word has length 122 [2022-10-15 21:52:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:35,724 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 460 transitions. [2022-10-15 21:52:35,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 460 transitions. [2022-10-15 21:52:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-10-15 21:52:35,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:35,728 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:35,770 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:52:35,942 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,SelfDestructingSolverStorable15 [2022-10-15 21:52:35,942 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2049904028, now seen corresponding path program 1 times [2022-10-15 21:52:35,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:35,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501614635] [2022-10-15 21:52:35,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:52:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-15 21:52:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:36,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501614635] [2022-10-15 21:52:36,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501614635] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:36,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201711770] [2022-10-15 21:52:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:36,129 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:52:36,148 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:52:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:36,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:36,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:36,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201711770] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:36,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:36,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134348748] [2022-10-15 21:52:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:36,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:36,307 INFO L87 Difference]: Start difference. First operand 300 states and 460 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:36,368 INFO L93 Difference]: Finished difference Result 388 states and 604 transitions. [2022-10-15 21:52:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2022-10-15 21:52:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:36,373 INFO L225 Difference]: With dead ends: 388 [2022-10-15 21:52:36,373 INFO L226 Difference]: Without dead ends: 387 [2022-10-15 21:52:36,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:36,374 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 107 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:36,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-10-15 21:52:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 301. [2022-10-15 21:52:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.540084388185654) internal successors, (365), 244 states have internal predecessors, (365), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 461 transitions. [2022-10-15 21:52:36,393 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 461 transitions. Word has length 123 [2022-10-15 21:52:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:36,393 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 461 transitions. [2022-10-15 21:52:36,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 461 transitions. [2022-10-15 21:52:36,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-10-15 21:52:36,396 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:36,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:36,436 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:52:36,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:36,612 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 791175385, now seen corresponding path program 1 times [2022-10-15 21:52:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:36,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086714232] [2022-10-15 21:52:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:52:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-15 21:52:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:36,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:36,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086714232] [2022-10-15 21:52:36,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086714232] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:36,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681518479] [2022-10-15 21:52:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:36,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:36,798 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:52:36,820 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:52:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:36,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:36,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:36,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681518479] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:36,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:36,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655214212] [2022-10-15 21:52:36,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:36,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:36,997 INFO L87 Difference]: Start difference. First operand 301 states and 461 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:37,135 INFO L93 Difference]: Finished difference Result 654 states and 1018 transitions. [2022-10-15 21:52:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:37,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 124 [2022-10-15 21:52:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:37,139 INFO L225 Difference]: With dead ends: 654 [2022-10-15 21:52:37,140 INFO L226 Difference]: Without dead ends: 443 [2022-10-15 21:52:37,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:37,142 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 189 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:37,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 2108 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-10-15 21:52:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 307. [2022-10-15 21:52:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 242 states have (on average 1.5330578512396693) internal successors, (371), 249 states have internal predecessors, (371), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-10-15 21:52:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 469 transitions. [2022-10-15 21:52:37,160 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 469 transitions. Word has length 124 [2022-10-15 21:52:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:37,161 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 469 transitions. [2022-10-15 21:52:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 469 transitions. [2022-10-15 21:52:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-10-15 21:52:37,164 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:37,164 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:37,205 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:52:37,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 21:52:37,378 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:37,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 396072665, now seen corresponding path program 1 times [2022-10-15 21:52:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:37,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324662073] [2022-10-15 21:52:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:52:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-15 21:52:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:37,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324662073] [2022-10-15 21:52:37,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324662073] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47764950] [2022-10-15 21:52:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:37,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:37,552 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:52:37,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-15 21:52:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:37,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:37,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:37,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47764950] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:37,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:37,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814000341] [2022-10-15 21:52:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:37,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:37,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:37,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:37,775 INFO L87 Difference]: Start difference. First operand 307 states and 469 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:37,916 INFO L93 Difference]: Finished difference Result 445 states and 695 transitions. [2022-10-15 21:52:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 124 [2022-10-15 21:52:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:37,921 INFO L225 Difference]: With dead ends: 445 [2022-10-15 21:52:37,921 INFO L226 Difference]: Without dead ends: 444 [2022-10-15 21:52:37,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:37,923 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 195 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:37,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1975 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-10-15 21:52:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 304. [2022-10-15 21:52:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 240 states have (on average 1.5333333333333334) internal successors, (368), 247 states have internal predecessors, (368), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 464 transitions. [2022-10-15 21:52:37,945 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 464 transitions. Word has length 124 [2022-10-15 21:52:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:37,946 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 464 transitions. [2022-10-15 21:52:37,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 464 transitions. [2022-10-15 21:52:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-15 21:52:37,950 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:37,950 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:37,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:38,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:38,163 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1243366464, now seen corresponding path program 1 times [2022-10-15 21:52:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:38,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431487108] [2022-10-15 21:52:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:52:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-15 21:52:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:38,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431487108] [2022-10-15 21:52:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431487108] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:38,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852538261] [2022-10-15 21:52:38,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:38,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:38,329 INFO L229 MonitoredProcess]: Starting monitored process 18 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:52:38,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-15 21:52:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:38,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:38,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:38,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852538261] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:38,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:38,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533175705] [2022-10-15 21:52:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:38,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:38,526 INFO L87 Difference]: Start difference. First operand 304 states and 464 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:38,657 INFO L93 Difference]: Finished difference Result 448 states and 702 transitions. [2022-10-15 21:52:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:52:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2022-10-15 21:52:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:38,662 INFO L225 Difference]: With dead ends: 448 [2022-10-15 21:52:38,662 INFO L226 Difference]: Without dead ends: 447 [2022-10-15 21:52:38,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:38,664 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 236 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:38,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1870 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-10-15 21:52:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 307. [2022-10-15 21:52:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 242 states have (on average 1.5330578512396693) internal successors, (371), 249 states have internal predecessors, (371), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-10-15 21:52:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 469 transitions. [2022-10-15 21:52:38,682 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 469 transitions. Word has length 125 [2022-10-15 21:52:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:38,682 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 469 transitions. [2022-10-15 21:52:38,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 469 transitions. [2022-10-15 21:52:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-15 21:52:38,686 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:38,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:38,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:38,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:38,901 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -606648896, now seen corresponding path program 1 times [2022-10-15 21:52:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:38,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962145588] [2022-10-15 21:52:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:52:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-15 21:52:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:39,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962145588] [2022-10-15 21:52:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962145588] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:39,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062732019] [2022-10-15 21:52:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:39,088 INFO L229 MonitoredProcess]: Starting monitored process 19 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:52:39,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-15 21:52:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:39,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:39,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:39,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062732019] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:39,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:39,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650508615] [2022-10-15 21:52:39,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:39,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:39,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:39,320 INFO L87 Difference]: Start difference. First operand 307 states and 469 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:39,441 INFO L93 Difference]: Finished difference Result 449 states and 703 transitions. [2022-10-15 21:52:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:52:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2022-10-15 21:52:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:39,446 INFO L225 Difference]: With dead ends: 449 [2022-10-15 21:52:39,446 INFO L226 Difference]: Without dead ends: 448 [2022-10-15 21:52:39,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:39,448 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 287 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:39,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1696 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-10-15 21:52:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 303. [2022-10-15 21:52:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 239 states have (on average 1.5355648535564854) internal successors, (367), 246 states have internal predecessors, (367), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 463 transitions. [2022-10-15 21:52:39,465 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 463 transitions. Word has length 125 [2022-10-15 21:52:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:39,466 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 463 transitions. [2022-10-15 21:52:39,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 463 transitions. [2022-10-15 21:52:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-10-15 21:52:39,469 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:39,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:39,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:39,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:39,685 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1712555779, now seen corresponding path program 1 times [2022-10-15 21:52:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:39,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854904404] [2022-10-15 21:52:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:52:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-10-15 21:52:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:39,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:39,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854904404] [2022-10-15 21:52:39,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854904404] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:39,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880294524] [2022-10-15 21:52:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:39,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:39,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:39,889 INFO L229 MonitoredProcess]: Starting monitored process 20 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:52:39,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-15 21:52:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:52:40,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:40,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:40,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880294524] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:40,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:40,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-10-15 21:52:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97440181] [2022-10-15 21:52:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:40,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:52:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:52:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:40,146 INFO L87 Difference]: Start difference. First operand 303 states and 463 transitions. Second operand has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-10-15 21:52:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:40,394 INFO L93 Difference]: Finished difference Result 527 states and 833 transitions. [2022-10-15 21:52:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:52:40,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 126 [2022-10-15 21:52:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:40,403 INFO L225 Difference]: With dead ends: 527 [2022-10-15 21:52:40,404 INFO L226 Difference]: Without dead ends: 526 [2022-10-15 21:52:40,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:52:40,408 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 316 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2951 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:40,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2951 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-10-15 21:52:40,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 302. [2022-10-15 21:52:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 239 states have (on average 1.5313807531380754) internal successors, (366), 245 states have internal predecessors, (366), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 462 transitions. [2022-10-15 21:52:40,444 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 462 transitions. Word has length 126 [2022-10-15 21:52:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:40,445 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 462 transitions. [2022-10-15 21:52:40,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-10-15 21:52:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 462 transitions. [2022-10-15 21:52:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-15 21:52:40,450 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:40,450 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:40,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:40,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:40,665 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:40,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1549621220, now seen corresponding path program 1 times [2022-10-15 21:52:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:40,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957859072] [2022-10-15 21:52:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 21:52:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-10-15 21:52:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957859072] [2022-10-15 21:52:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957859072] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376097551] [2022-10-15 21:52:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:40,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:40,884 INFO L229 MonitoredProcess]: Starting monitored process 21 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:52:40,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-15 21:52:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:52:41,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:41,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376097551] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:41,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:41,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-10-15 21:52:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383062610] [2022-10-15 21:52:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:41,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:52:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:52:41,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:41,118 INFO L87 Difference]: Start difference. First operand 302 states and 462 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-10-15 21:52:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:41,314 INFO L93 Difference]: Finished difference Result 737 states and 1156 transitions. [2022-10-15 21:52:41,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:41,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 127 [2022-10-15 21:52:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:41,315 INFO L225 Difference]: With dead ends: 737 [2022-10-15 21:52:41,315 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:52:41,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-10-15 21:52:41,320 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 330 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:41,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 2970 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:52:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:52:41,321 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:52:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:52:41,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2022-10-15 21:52:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:41,322 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:52:41,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-10-15 21:52:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:52:41,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:52:41,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-10-15 21:52:41,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-10-15 21:52:41,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-10-15 21:52:41,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-10-15 21:52:41,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-10-15 21:52:41,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-10-15 21:52:41,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-10-15 21:52:41,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-10-15 21:52:41,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-15 21:52:41,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:52:41,841 INFO L902 garLoopResultBuilder]: At program point L119(line 119) the Hoare annotation is: true [2022-10-15 21:52:41,841 INFO L899 garLoopResultBuilder]: For program point L119-1(line 119) no Hoare annotation was computed. [2022-10-15 21:52:41,842 INFO L899 garLoopResultBuilder]: For program point read_history_int8FINAL(lines 104 123) no Hoare annotation was computed. [2022-10-15 21:52:41,842 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-10-15 21:52:41,842 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 117) no Hoare annotation was computed. [2022-10-15 21:52:41,842 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 120) no Hoare annotation was computed. [2022-10-15 21:52:41,842 INFO L899 garLoopResultBuilder]: For program point read_history_int8EXIT(lines 104 123) no Hoare annotation was computed. [2022-10-15 21:52:41,844 INFO L902 garLoopResultBuilder]: At program point read_history_int8ENTRY(lines 104 123) the Hoare annotation is: true [2022-10-15 21:52:41,844 INFO L895 garLoopResultBuilder]: At program point L159(line 159) the Hoare annotation is: (and (<= |read_history_bool_#in~history_id| read_history_bool_~history_id) (<= |read_history_bool_#in~historyIndex| read_history_bool_~historyIndex)) [2022-10-15 21:52:41,844 INFO L899 garLoopResultBuilder]: For program point L159-1(line 159) no Hoare annotation was computed. [2022-10-15 21:52:41,844 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 157) no Hoare annotation was computed. [2022-10-15 21:52:41,844 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 160) no Hoare annotation was computed. [2022-10-15 21:52:41,844 INFO L899 garLoopResultBuilder]: For program point read_history_boolFINAL(lines 124 163) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 147) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 160) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point read_history_boolEXIT(lines 124 163) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L902 garLoopResultBuilder]: At program point read_history_boolENTRY(lines 124 163) the Hoare annotation is: true [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 160) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 157) no Hoare annotation was computed. [2022-10-15 21:52:41,845 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 147) no Hoare annotation was computed. [2022-10-15 21:52:41,846 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 137) no Hoare annotation was computed. [2022-10-15 21:52:41,846 INFO L902 garLoopResultBuilder]: At program point assertENTRY(lines 530 541) the Hoare annotation is: true [2022-10-15 21:52:41,846 INFO L899 garLoopResultBuilder]: For program point assertEXIT(lines 530 541) no Hoare annotation was computed. [2022-10-15 21:52:41,846 INFO L899 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-10-15 21:52:41,846 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2022-10-15 21:52:41,846 INFO L899 garLoopResultBuilder]: For program point L535-2(lines 530 541) no Hoare annotation was computed. [2022-10-15 21:52:41,846 INFO L899 garLoopResultBuilder]: For program point L448(lines 448 452) no Hoare annotation was computed. [2022-10-15 21:52:41,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 277) no Hoare annotation was computed. [2022-10-15 21:52:41,847 INFO L899 garLoopResultBuilder]: For program point L349(line 349) no Hoare annotation was computed. [2022-10-15 21:52:41,847 INFO L899 garLoopResultBuilder]: For program point L349-2(line 349) no Hoare annotation was computed. [2022-10-15 21:52:41,847 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 472) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L899 garLoopResultBuilder]: For program point L366-1(line 366) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 301) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 426) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 294) no Hoare annotation was computed. [2022-10-15 21:52:41,848 INFO L902 garLoopResultBuilder]: At program point L367(lines 339 369) the Hoare annotation is: true [2022-10-15 21:52:41,848 INFO L902 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: true [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 175) no Hoare annotation was computed. [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 291) no Hoare annotation was computed. [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 262) no Hoare annotation was computed. [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 300) no Hoare annotation was computed. [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 395) no Hoare annotation was computed. [2022-10-15 21:52:41,849 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 288) no Hoare annotation was computed. [2022-10-15 21:52:41,850 INFO L902 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: true [2022-10-15 21:52:41,850 INFO L899 garLoopResultBuilder]: For program point L220-1(line 220) no Hoare annotation was computed. [2022-10-15 21:52:41,850 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 472) no Hoare annotation was computed. [2022-10-15 21:52:41,850 INFO L902 garLoopResultBuilder]: At program point L336(lines 231 338) the Hoare annotation is: true [2022-10-15 21:52:41,850 INFO L899 garLoopResultBuilder]: For program point L303(line 303) no Hoare annotation was computed. [2022-10-15 21:52:41,850 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 426) no Hoare annotation was computed. [2022-10-15 21:52:41,850 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 223) no Hoare annotation was computed. [2022-10-15 21:52:41,850 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 322) no Hoare annotation was computed. [2022-10-15 21:52:41,852 INFO L895 garLoopResultBuilder]: At program point L271(line 271) the Hoare annotation is: (and (<= |ULTIMATE.start_check_~temp_count~0#1| 0) (<= 0 |ULTIMATE.start_check_~temp_count~0#1|)) [2022-10-15 21:52:41,853 INFO L902 garLoopResultBuilder]: At program point L304-1(lines 304 322) the Hoare annotation is: true [2022-10-15 21:52:41,853 INFO L899 garLoopResultBuilder]: For program point L271-1(line 271) no Hoare annotation was computed. [2022-10-15 21:52:41,853 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 364) no Hoare annotation was computed. [2022-10-15 21:52:41,853 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 262) no Hoare annotation was computed. [2022-10-15 21:52:41,853 INFO L902 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: true [2022-10-15 21:52:41,853 INFO L899 garLoopResultBuilder]: For program point L503-1(line 503) no Hoare annotation was computed. [2022-10-15 21:52:41,853 INFO L902 garLoopResultBuilder]: At program point L305(line 305) the Hoare annotation is: true [2022-10-15 21:52:41,856 INFO L899 garLoopResultBuilder]: For program point L272(lines 272 274) no Hoare annotation was computed. [2022-10-15 21:52:41,856 INFO L899 garLoopResultBuilder]: For program point L305-1(line 305) no Hoare annotation was computed. [2022-10-15 21:52:41,857 INFO L895 garLoopResultBuilder]: At program point L272-2(lines 272 274) the Hoare annotation is: (or (and (<= |ULTIMATE.start_check_~temp_count~0#1| 0) (<= 0 |ULTIMATE.start_check_~temp_count~0#1|)) (and (<= 1 |ULTIMATE.start_check_~temp_count~0#1|) (<= |ULTIMATE.start_check_~temp_count~0#1| 1))) [2022-10-15 21:52:41,857 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 472) no Hoare annotation was computed. [2022-10-15 21:52:41,857 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 395) no Hoare annotation was computed. [2022-10-15 21:52:41,857 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:52:41,857 INFO L902 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: true [2022-10-15 21:52:41,857 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 444 472) no Hoare annotation was computed. [2022-10-15 21:52:41,857 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 321) no Hoare annotation was computed. [2022-10-15 21:52:41,858 INFO L899 garLoopResultBuilder]: For program point L273(line 273) no Hoare annotation was computed. [2022-10-15 21:52:41,858 INFO L899 garLoopResultBuilder]: For program point L273-1(line 273) no Hoare annotation was computed. [2022-10-15 21:52:41,858 INFO L902 garLoopResultBuilder]: At program point L174(line 174) the Hoare annotation is: true [2022-10-15 21:52:41,858 INFO L902 garLoopResultBuilder]: At program point L174-1(lines 164 178) the Hoare annotation is: true [2022-10-15 21:52:41,858 INFO L899 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-10-15 21:52:41,858 INFO L902 garLoopResultBuilder]: At program point L422-2(lines 416 426) the Hoare annotation is: true [2022-10-15 21:52:41,859 INFO L899 garLoopResultBuilder]: For program point L323(line 323) no Hoare annotation was computed. [2022-10-15 21:52:41,859 INFO L902 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: true [2022-10-15 21:52:41,859 INFO L899 garLoopResultBuilder]: For program point L224-1(line 224) no Hoare annotation was computed. [2022-10-15 21:52:41,859 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 277) no Hoare annotation was computed. [2022-10-15 21:52:41,859 INFO L902 garLoopResultBuilder]: At program point L307(line 307) the Hoare annotation is: true [2022-10-15 21:52:41,859 INFO L899 garLoopResultBuilder]: For program point L307-1(line 307) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 460) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 335) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 324 335) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L899 garLoopResultBuilder]: For program point L225(lines 225 227) no Hoare annotation was computed. [2022-10-15 21:52:41,860 INFO L902 garLoopResultBuilder]: At program point L258-2(lines 252 262) the Hoare annotation is: true [2022-10-15 21:52:41,861 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 320) no Hoare annotation was computed. [2022-10-15 21:52:41,861 INFO L899 garLoopResultBuilder]: For program point L275(line 275) no Hoare annotation was computed. [2022-10-15 21:52:41,861 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-10-15 21:52:41,861 INFO L902 garLoopResultBuilder]: At program point L391-2(lines 385 395) the Hoare annotation is: true [2022-10-15 21:52:41,861 INFO L902 garLoopResultBuilder]: At program point L325(line 325) the Hoare annotation is: true [2022-10-15 21:52:41,861 INFO L899 garLoopResultBuilder]: For program point L325-1(line 325) no Hoare annotation was computed. [2022-10-15 21:52:41,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-10-15 21:52:41,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:52:41,862 INFO L902 garLoopResultBuilder]: At program point L474(lines 432 476) the Hoare annotation is: true [2022-10-15 21:52:41,862 INFO L902 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: true [2022-10-15 21:52:41,862 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 278) no Hoare annotation was computed. [2022-10-15 21:52:41,863 INFO L899 garLoopResultBuilder]: For program point L309-1(line 309) no Hoare annotation was computed. [2022-10-15 21:52:41,863 INFO L895 garLoopResultBuilder]: At program point L276-2(lines 276 278) the Hoare annotation is: (or (and (<= |ULTIMATE.start_check_~temp_count~0#1| 0) (<= 0 |ULTIMATE.start_check_~temp_count~0#1|)) (and (<= |ULTIMATE.start_check_~temp_count~0#1| 2) (<= 2 |ULTIMATE.start_check_~temp_count~0#1|)) (and (<= 1 |ULTIMATE.start_check_~temp_count~0#1|) (<= |ULTIMATE.start_check_~temp_count~0#1| 1))) [2022-10-15 21:52:41,863 INFO L902 garLoopResultBuilder]: At program point L524(line 524) the Hoare annotation is: true [2022-10-15 21:52:41,863 INFO L902 garLoopResultBuilder]: At program point L524-1(lines 511 526) the Hoare annotation is: true [2022-10-15 21:52:41,863 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 334) no Hoare annotation was computed. [2022-10-15 21:52:41,863 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-10-15 21:52:41,866 INFO L902 garLoopResultBuilder]: At program point L409(line 409) the Hoare annotation is: true [2022-10-15 21:52:41,866 INFO L899 garLoopResultBuilder]: For program point L409-1(lines 407 430) no Hoare annotation was computed. [2022-10-15 21:52:41,866 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 317) no Hoare annotation was computed. [2022-10-15 21:52:41,866 INFO L899 garLoopResultBuilder]: For program point L277(line 277) no Hoare annotation was computed. [2022-10-15 21:52:41,867 INFO L899 garLoopResultBuilder]: For program point L277-1(line 277) no Hoare annotation was computed. [2022-10-15 21:52:41,867 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-10-15 21:52:41,867 INFO L902 garLoopResultBuilder]: At program point L327(line 327) the Hoare annotation is: true [2022-10-15 21:52:41,868 INFO L902 garLoopResultBuilder]: At program point L360-2(lines 354 364) the Hoare annotation is: true [2022-10-15 21:52:41,868 INFO L899 garLoopResultBuilder]: For program point L327-1(line 327) no Hoare annotation was computed. [2022-10-15 21:52:41,868 INFO L902 garLoopResultBuilder]: At program point L228(lines 204 230) the Hoare annotation is: true [2022-10-15 21:52:41,868 INFO L902 garLoopResultBuilder]: At program point L311(line 311) the Hoare annotation is: true [2022-10-15 21:52:41,868 INFO L899 garLoopResultBuilder]: For program point L311-1(line 311) no Hoare annotation was computed. [2022-10-15 21:52:41,868 INFO L902 garLoopResultBuilder]: At program point L212(line 212) the Hoare annotation is: true [2022-10-15 21:52:41,869 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-10-15 21:52:41,869 INFO L899 garLoopResultBuilder]: For program point L427(lines 407 430) no Hoare annotation was computed. [2022-10-15 21:52:41,869 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 333) no Hoare annotation was computed. [2022-10-15 21:52:41,869 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 472) no Hoare annotation was computed. [2022-10-15 21:52:41,869 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-10-15 21:52:41,869 INFO L902 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: true [2022-10-15 21:52:41,869 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 376 399) no Hoare annotation was computed. [2022-10-15 21:52:41,870 INFO L899 garLoopResultBuilder]: For program point L411-2(line 411) no Hoare annotation was computed. [2022-10-15 21:52:41,871 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 314) no Hoare annotation was computed. [2022-10-15 21:52:41,871 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-10-15 21:52:41,871 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 215) no Hoare annotation was computed. [2022-10-15 21:52:41,871 INFO L899 garLoopResultBuilder]: For program point L428-1(line 428) no Hoare annotation was computed. [2022-10-15 21:52:41,872 INFO L902 garLoopResultBuilder]: At program point L329(line 329) the Hoare annotation is: true [2022-10-15 21:52:41,872 INFO L902 garLoopResultBuilder]: At program point L296(lines 283 299) the Hoare annotation is: true [2022-10-15 21:52:41,872 INFO L899 garLoopResultBuilder]: For program point L329-1(line 329) no Hoare annotation was computed. [2022-10-15 21:52:41,872 INFO L902 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: true [2022-10-15 21:52:41,872 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:52:41,872 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 281) no Hoare annotation was computed. [2022-10-15 21:52:41,873 INFO L899 garLoopResultBuilder]: For program point L511-2(lines 511 526) no Hoare annotation was computed. [2022-10-15 21:52:41,873 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 282) no Hoare annotation was computed. [2022-10-15 21:52:41,873 INFO L899 garLoopResultBuilder]: For program point L280-2(lines 269 300) no Hoare annotation was computed. [2022-10-15 21:52:41,873 INFO L895 garLoopResultBuilder]: At program point L528(lines 477 529) the Hoare annotation is: false [2022-10-15 21:52:41,873 INFO L899 garLoopResultBuilder]: For program point L462(lines 462 472) no Hoare annotation was computed. [2022-10-15 21:52:41,873 INFO L902 garLoopResultBuilder]: At program point L429(lines 401 431) the Hoare annotation is: true [2022-10-15 21:52:41,873 INFO L899 garLoopResultBuilder]: For program point L396(lines 376 399) no Hoare annotation was computed. [2022-10-15 21:52:41,873 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 332) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point L264(line 264) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 281) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L902 garLoopResultBuilder]: At program point L347(line 347) the Hoare annotation is: true [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point L347-1(lines 345 368) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point L380-2(line 380) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-10-15 21:52:41,874 INFO L899 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2022-10-15 21:52:41,875 INFO L899 garLoopResultBuilder]: For program point L397-1(line 397) no Hoare annotation was computed. [2022-10-15 21:52:41,875 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 302) no Hoare annotation was computed. [2022-10-15 21:52:41,875 INFO L902 garLoopResultBuilder]: At program point L265-1(lines 265 302) the Hoare annotation is: true [2022-10-15 21:52:41,875 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 472) no Hoare annotation was computed. [2022-10-15 21:52:41,875 INFO L902 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: true [2022-10-15 21:52:41,875 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-10-15 21:52:41,875 INFO L902 garLoopResultBuilder]: At program point L398(lines 370 400) the Hoare annotation is: true [2022-10-15 21:52:41,875 INFO L899 garLoopResultBuilder]: For program point L365(lines 345 368) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L902 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point L266-1(line 266) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 75 98) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 91) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 98) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 79) no Hoare annotation was computed. [2022-10-15 21:52:41,876 INFO L899 garLoopResultBuilder]: For program point add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-10-15 21:52:41,877 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (not (= |add_history_type_#in~history_id| 0)) (or (= add_history_type_~var~0 0) (and (<= add_history_type_~var~0 2) (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:41,877 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2022-10-15 21:52:41,877 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (not (= |add_history_type_#in~history_id| 0)) (or (= add_history_type_~var~0 0) (and (<= add_history_type_~var~0 2) (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:41,877 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-10-15 21:52:41,877 INFO L895 garLoopResultBuilder]: At program point L74-2(lines 74 100) the Hoare annotation is: (and (or (not (= |add_history_type_#in~history_id| 0)) (= add_history_type_~history_id 0)) (or (= add_history_type_~var~0 0) (<= 1 add_history_type_~var~0))) [2022-10-15 21:52:41,877 INFO L899 garLoopResultBuilder]: For program point L74-3(lines 74 100) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 97) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 98) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 85) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point add_history_typeEXIT(lines 60 103) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 98) no Hoare annotation was computed. [2022-10-15 21:52:41,878 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (not (= |add_history_type_#in~history_id| 0)) (or (= add_history_type_~var~0 0) (and (<= add_history_type_~var~0 2) (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:41,879 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2022-10-15 21:52:41,879 INFO L902 garLoopResultBuilder]: At program point add_history_typeENTRY(lines 60 103) the Hoare annotation is: true [2022-10-15 21:52:41,879 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (= add_history_type_~history_id 0))) (or (and (= add_history_type_~var~0 0) .cse0) (and (<= add_history_type_~var~0 2) .cse0 (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:41,879 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2022-10-15 21:52:41,879 INFO L899 garLoopResultBuilder]: For program point add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-10-15 21:52:41,879 INFO L899 garLoopResultBuilder]: For program point add_history_typeFINAL(lines 60 103) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 36 38) the Hoare annotation is: true [2022-10-15 21:52:41,880 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 36 38) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 36 38) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 200) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L899 garLoopResultBuilder]: For program point write_history_boolEXIT(lines 179 203) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 200) no Hoare annotation was computed. [2022-10-15 21:52:41,880 INFO L902 garLoopResultBuilder]: At program point write_history_boolENTRY(lines 179 203) the Hoare annotation is: true [2022-10-15 21:52:41,881 INFO L895 garLoopResultBuilder]: At program point L199(line 199) the Hoare annotation is: (<= |write_history_bool_#in~history_id| write_history_bool_~history_id) [2022-10-15 21:52:41,881 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 179 203) no Hoare annotation was computed. [2022-10-15 21:52:41,882 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 200) no Hoare annotation was computed. [2022-10-15 21:52:41,887 INFO L444 BasicCegarLoop]: Path program histogram: [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:52:41,889 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:52:41,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:52:41 BoogieIcfgContainer [2022-10-15 21:52:41,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:52:41,911 INFO L158 Benchmark]: Toolchain (without parser) took 18730.99ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 143.7MB in the beginning and 142.4MB in the end (delta: 1.3MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. [2022-10-15 21:52:41,911 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 169.9MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:52:41,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.95ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 128.1MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 21:52:41,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.81ms. Allocated memory is still 169.9MB. Free memory was 128.0MB in the beginning and 125.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:41,913 INFO L158 Benchmark]: Boogie Preprocessor took 110.01ms. Allocated memory is still 169.9MB. Free memory was 125.2MB in the beginning and 122.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:41,913 INFO L158 Benchmark]: RCFGBuilder took 1090.79ms. Allocated memory is still 169.9MB. Free memory was 122.7MB in the beginning and 129.0MB in the end (delta: -6.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-10-15 21:52:41,916 INFO L158 Benchmark]: TraceAbstraction took 16889.55ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 128.5MB in the beginning and 142.4MB in the end (delta: -13.9MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2022-10-15 21:52:41,920 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.22ms. Allocated memory is still 169.9MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 535.95ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 128.1MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.81ms. Allocated memory is still 169.9MB. Free memory was 128.0MB in the beginning and 125.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 110.01ms. Allocated memory is still 169.9MB. Free memory was 125.2MB in the beginning and 122.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1090.79ms. Allocated memory is still 169.9MB. Free memory was 122.7MB in the beginning and 129.0MB in the end (delta: -6.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * TraceAbstraction took 16889.55ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 128.5MB in the beginning and 142.4MB in the end (delta: -13.9MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: 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 7 procedures, 202 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3330 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2955 mSDsluCounter, 32434 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23381 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1243 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 9053 mSDtfsCounter, 1243 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2809 GetRequests, 2604 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=18, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 1553 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 853 PreInvPairs, 989 NumberOfFragments, 180 HoareAnnotationTreeSize, 853 FomulaSimplifications, 276 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 54 FomulaSimplificationsInter, 191 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 4466 NumberOfCodeBlocks, 4466 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4423 ConstructedInterpolants, 0 QuantifiedInterpolants, 6616 SizeOfPredicates, 31 NumberOfNonLiveVariables, 10580 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 43 InterpolantComputations, 23 PerfectInterpolantSequences, 1927/1992 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (!(\old(history_id) == 0) || history_id == 0) && (var == 0 || 1 <= var) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-10-15 21:52:41,994 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...