/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.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:52:21,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:52:21,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:52:21,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:52:21,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:52:21,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:52:21,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:52:21,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:52:21,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:52:21,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:52:21,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:52:21,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:52:21,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:52:21,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:52:21,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:52:21,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:52:21,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:52:21,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:52:21,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:52:21,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:52:21,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:52:21,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:52:21,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:52:21,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:52:21,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:52:21,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:52:21,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:52:21,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:52:21,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:52:21,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:52:21,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:52:21,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:52:21,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:52:21,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:52:21,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:52:21,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:52:21,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:52:21,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:52:21,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:52:21,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:52:21,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:52:21,876 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,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:52:21,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:52:21,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:52:21,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:52:21,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:52:21,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:52:21,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:52:21,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:52:21,925 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:52:21,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:52:21,926 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:52:21,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:52:21,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:52:21,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:52:21,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:52:21,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:52:21,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:52:21,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:52:21,928 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:52:21,928 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:52:21,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:52:21,928 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:52:21,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:52:21,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:52:21,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:52:21,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:52:21,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:52:21,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:52:21,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:52:21,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:52:21,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:52:21,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:52:21,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:52:21,932 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:22,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:52:22,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:52:22,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:52:22,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:52:22,377 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:52:22,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:22,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b97a201/36853b668072493fbd2711d3ae019ff0/FLAGf98279133 [2022-10-15 21:52:23,041 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:52:23,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:23,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b97a201/36853b668072493fbd2711d3ae019ff0/FLAGf98279133 [2022-10-15 21:52:23,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b97a201/36853b668072493fbd2711d3ae019ff0 [2022-10-15 21:52:23,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:52:23,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:52:23,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:52:23,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:52:23,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:52:23,399 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,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc39170 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,400 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,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:52:23,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:52:23,756 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.2.ufo.UNBOUNDED.pals.c[11921,11934] [2022-10-15 21:52:23,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:52:23,766 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:52:23,837 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.2.ufo.UNBOUNDED.pals.c[11921,11934] [2022-10-15 21:52:23,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:52:23,865 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:52:23,866 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,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:52:23,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:52:23,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:52:23,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:52:23,877 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,907 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,952 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 408 [2022-10-15 21:52:23,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:52:23,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:52:23,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:52:23,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:52:23,964 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,964 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,970 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,970 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,983 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,992 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,995 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,998 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:24,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:52:24,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:52:24,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:52:24,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:52:24,008 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:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:52:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:24,082 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,102 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,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:52:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-10-15 21:52:24,157 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-10-15 21:52:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-10-15 21:52:24,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-10-15 21:52:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-10-15 21:52:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-10-15 21:52:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-10-15 21:52:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-10-15 21:52:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-10-15 21:52:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-10-15 21:52:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:52:24,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:52:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:52:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:52:24,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:52:24,347 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:52:24,349 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:52:25,019 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:52:25,036 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:52:25,036 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 21:52:25,039 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,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:52:25,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:52:25,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:52:25,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:52:25,046 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,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761521d9 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,047 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,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761521d9 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,048 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,049 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:25,071 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:52:25,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 21:52:25,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:52:25,142 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;@62b23c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:52:25,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 21:52:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 149 states have (on average 1.604026845637584) internal successors, (239), 161 states have internal predecessors, (239), 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,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 21:52:25,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:25,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:25,159 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,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash 843546830, now seen corresponding path program 1 times [2022-10-15 21:52:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605787641] [2022-10-15 21:52:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:25,492 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,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605787641] [2022-10-15 21:52:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605787641] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:25,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:52:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503308421] [2022-10-15 21:52:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:25,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:25,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:25,536 INFO L87 Difference]: Start difference. First operand has 201 states, 149 states have (on average 1.604026845637584) internal successors, (239), 161 states have internal predecessors, (239), 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,688 INFO L93 Difference]: Finished difference Result 419 states and 690 transitions. [2022-10-15 21:52:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:25,691 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,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:25,705 INFO L225 Difference]: With dead ends: 419 [2022-10-15 21:52:25,706 INFO L226 Difference]: Without dead ends: 220 [2022-10-15 21:52:25,713 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,718 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 37 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 899 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,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 899 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,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-15 21:52:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2022-10-15 21:52:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.55625) internal successors, (249), 171 states have internal predecessors, (249), 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,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 325 transitions. [2022-10-15 21:52:25,815 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 325 transitions. Word has length 11 [2022-10-15 21:52:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:25,815 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 325 transitions. [2022-10-15 21:52:25,817 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,817 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 325 transitions. [2022-10-15 21:52:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 21:52:25,819 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:25,820 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,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:52:25,820 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,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash -746147352, now seen corresponding path program 1 times [2022-10-15 21:52:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:25,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622532066] [2022-10-15 21:52:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,059 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:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:26,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622532066] [2022-10-15 21:52:26,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622532066] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:26,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:26,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:52:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530020496] [2022-10-15 21:52:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:26,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:26,071 INFO L87 Difference]: Start difference. First operand 213 states and 325 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,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:26,143 INFO L93 Difference]: Finished difference Result 449 states and 695 transitions. [2022-10-15 21:52:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:26,148 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,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:26,154 INFO L225 Difference]: With dead ends: 449 [2022-10-15 21:52:26,154 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 21:52:26,156 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,159 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 21 mSDsluCounter, 603 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,159 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,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 21:52:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2022-10-15 21:52:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 186 states have (on average 1.5268817204301075) internal successors, (284), 197 states have internal predecessors, (284), 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,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 370 transitions. [2022-10-15 21:52:26,218 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 370 transitions. Word has length 16 [2022-10-15 21:52:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:26,220 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 370 transitions. [2022-10-15 21:52:26,220 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,221 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 370 transitions. [2022-10-15 21:52:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:52:26,224 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:26,225 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,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:52:26,225 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,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -6127064, now seen corresponding path program 1 times [2022-10-15 21:52:26,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:26,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624965508] [2022-10-15 21:52:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:26,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,357 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,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:26,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624965508] [2022-10-15 21:52:26,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624965508] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:26,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:26,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:52:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486384088] [2022-10-15 21:52:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:26,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:26,361 INFO L87 Difference]: Start difference. First operand 244 states and 370 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,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:26,401 INFO L93 Difference]: Finished difference Result 248 states and 376 transitions. [2022-10-15 21:52:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:26,402 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,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:26,405 INFO L225 Difference]: With dead ends: 248 [2022-10-15 21:52:26,405 INFO L226 Difference]: Without dead ends: 247 [2022-10-15 21:52:26,406 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,408 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 23 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 862 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,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 862 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,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-10-15 21:52:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2022-10-15 21:52:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 186 states have (on average 1.510752688172043) internal successors, (281), 196 states have internal predecessors, (281), 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,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 367 transitions. [2022-10-15 21:52:26,431 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 367 transitions. Word has length 29 [2022-10-15 21:52:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:26,432 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 367 transitions. [2022-10-15 21:52:26,432 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,432 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 367 transitions. [2022-10-15 21:52:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:52:26,435 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:26,435 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,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:52:26,436 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,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -189938430, now seen corresponding path program 1 times [2022-10-15 21:52:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:26,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375371368] [2022-10-15 21:52:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,645 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,661 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,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375371368] [2022-10-15 21:52:26,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375371368] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768909861] [2022-10-15 21:52:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:26,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:26,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:26,674 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,679 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,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:26,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:26,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:26,889 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,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:26,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768909861] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:26,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:26,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 21:52:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263916082] [2022-10-15 21:52:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:26,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:52:26,896 INFO L87 Difference]: Start difference. First operand 243 states and 367 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:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:26,968 INFO L93 Difference]: Finished difference Result 247 states and 373 transitions. [2022-10-15 21:52:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:52:26,969 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:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:26,972 INFO L225 Difference]: With dead ends: 247 [2022-10-15 21:52:26,973 INFO L226 Difference]: Without dead ends: 246 [2022-10-15 21:52:26,973 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:26,975 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 44 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:26,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 947 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-15 21:52:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 213. [2022-10-15 21:52:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 162 states have (on average 1.5123456790123457) internal successors, (245), 171 states have internal predecessors, (245), 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:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 321 transitions. [2022-10-15 21:52:26,994 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 321 transitions. Word has length 30 [2022-10-15 21:52:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:26,995 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 321 transitions. [2022-10-15 21:52:26,995 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:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 321 transitions. [2022-10-15 21:52:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-15 21:52:27,001 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:27,001 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, 1] [2022-10-15 21:52:27,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 21:52:27,217 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,218 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,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1887388567, now seen corresponding path program 1 times [2022-10-15 21:52:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:27,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451593816] [2022-10-15 21:52:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-15 21:52:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-15 21:52:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:52:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-15 21:52:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-15 21:52:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-15 21:52:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,510 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,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451593816] [2022-10-15 21:52:27,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451593816] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169339895] [2022-10-15 21:52:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:27,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:27,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:27,515 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,517 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,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:27,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:27,712 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,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:27,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169339895] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:27,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:27,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749619009] [2022-10-15 21:52:27,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:27,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:27,715 INFO L87 Difference]: Start difference. First operand 213 states and 321 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:27,777 INFO L93 Difference]: Finished difference Result 373 states and 570 transitions. [2022-10-15 21:52:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 98 [2022-10-15 21:52:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:27,780 INFO L225 Difference]: With dead ends: 373 [2022-10-15 21:52:27,780 INFO L226 Difference]: Without dead ends: 220 [2022-10-15 21:52:27,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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,782 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 20 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 859 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,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 859 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,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-15 21:52:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-10-15 21:52:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 167 states have (on average 1.5149700598802396) internal successors, (253), 177 states have internal predecessors, (253), 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,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 331 transitions. [2022-10-15 21:52:27,801 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 331 transitions. Word has length 98 [2022-10-15 21:52:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:27,802 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 331 transitions. [2022-10-15 21:52:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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,802 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 331 transitions. [2022-10-15 21:52:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-15 21:52:27,806 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:27,806 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, 1] [2022-10-15 21:52:27,843 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,020 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,021 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,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2102143659, now seen corresponding path program 1 times [2022-10-15 21:52:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:28,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255475691] [2022-10-15 21:52:28,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:28,290 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 62 [2022-10-15 21:52:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-15 21:52:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:52:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-15 21:52:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,323 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,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255475691] [2022-10-15 21:52:28,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255475691] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:28,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065500444] [2022-10-15 21:52:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:28,325 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,340 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,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:28,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:28,544 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,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:28,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065500444] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:28,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:28,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959617629] [2022-10-15 21:52:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:28,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:28,551 INFO L87 Difference]: Start difference. First operand 220 states and 331 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:28,614 INFO L93 Difference]: Finished difference Result 387 states and 589 transitions. [2022-10-15 21:52:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:28,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:28,619 INFO L225 Difference]: With dead ends: 387 [2022-10-15 21:52:28,620 INFO L226 Difference]: Without dead ends: 227 [2022-10-15 21:52:28,627 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:28,630 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 18 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 859 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,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 859 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,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-10-15 21:52:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-10-15 21:52:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 183 states have internal predecessors, (261), 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 227 states to 227 states and 341 transitions. [2022-10-15 21:52:28,654 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 341 transitions. Word has length 100 [2022-10-15 21:52:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:28,654 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 341 transitions. [2022-10-15 21:52:28,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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,655 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 341 transitions. [2022-10-15 21:52:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:52:28,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:28,657 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, 1] [2022-10-15 21:52:28,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:28,872 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 -1676287810, now seen corresponding path program 1 times [2022-10-15 21:52:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:28,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202434592] [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,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:52:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:52:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,100 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,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:29,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202434592] [2022-10-15 21:52:29,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202434592] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:29,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926091660] [2022-10-15 21:52:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:29,105 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,125 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,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:29,306 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,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:29,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926091660] 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,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634949052] [2022-10-15 21:52:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:29,307 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,308 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 227 states and 341 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:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:29,396 INFO L93 Difference]: Finished difference Result 408 states and 627 transitions. [2022-10-15 21:52:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:29,397 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 101 [2022-10-15 21:52:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:29,399 INFO L225 Difference]: With dead ends: 408 [2022-10-15 21:52:29,400 INFO L226 Difference]: Without dead ends: 241 [2022-10-15 21:52:29,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 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,402 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 57 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 804 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,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 804 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,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-10-15 21:52:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-10-15 21:52:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 184 states have (on average 1.5326086956521738) internal successors, (282), 195 states have internal predecessors, (282), 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,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 364 transitions. [2022-10-15 21:52:29,417 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 364 transitions. Word has length 101 [2022-10-15 21:52:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:29,418 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 364 transitions. [2022-10-15 21:52:29,418 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:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 364 transitions. [2022-10-15 21:52:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-10-15 21:52:29,420 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:29,421 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, 1] [2022-10-15 21:52:29,457 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,636 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,637 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,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -466539529, now seen corresponding path program 1 times [2022-10-15 21:52:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:29,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534003583] [2022-10-15 21:52:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,841 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,850 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,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-15 21:52:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,871 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,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:29,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534003583] [2022-10-15 21:52:29,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534003583] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:29,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286019456] [2022-10-15 21:52:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:29,874 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,896 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,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:30,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:30,049 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,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:30,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286019456] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:30,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:30,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609728200] [2022-10-15 21:52:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:30,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:30,052 INFO L87 Difference]: Start difference. First operand 241 states and 364 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:30,138 INFO L93 Difference]: Finished difference Result 487 states and 751 transitions. [2022-10-15 21:52:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 104 [2022-10-15 21:52:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:30,143 INFO L225 Difference]: With dead ends: 487 [2022-10-15 21:52:30,143 INFO L226 Difference]: Without dead ends: 265 [2022-10-15 21:52:30,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 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,145 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 53 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 812 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,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 812 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,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-10-15 21:52:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-10-15 21:52:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 215 states have internal predecessors, (316), 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,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2022-10-15 21:52:30,167 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 104 [2022-10-15 21:52:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:30,168 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2022-10-15 21:52:30,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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,169 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2022-10-15 21:52:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-15 21:52:30,171 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:30,171 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, 1] [2022-10-15 21:52:30,222 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,387 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,387 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,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1464898709, now seen corresponding path program 1 times [2022-10-15 21:52:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:30,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748397798] [2022-10-15 21:52:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:30,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:30,500 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 19 [2022-10-15 21:52:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:30,554 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 45 [2022-10-15 21:52:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,580 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,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748397798] [2022-10-15 21:52:30,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748397798] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21276644] [2022-10-15 21:52:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:30,583 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,601 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,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:30,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:30,757 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,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:30,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21276644] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:30,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:30,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:30,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801774976] [2022-10-15 21:52:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:30,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:30,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:30,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:30,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:30,760 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:30,835 INFO L93 Difference]: Finished difference Result 531 states and 816 transitions. [2022-10-15 21:52:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 106 [2022-10-15 21:52:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:30,841 INFO L225 Difference]: With dead ends: 531 [2022-10-15 21:52:30,841 INFO L226 Difference]: Without dead ends: 285 [2022-10-15 21:52:30,843 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:30,845 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 47 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 808 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,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 808 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,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-10-15 21:52:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-10-15 21:52:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 231 states have internal predecessors, (342), 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,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 432 transitions. [2022-10-15 21:52:30,891 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 432 transitions. Word has length 106 [2022-10-15 21:52:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:30,891 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 432 transitions. [2022-10-15 21:52:30,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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,892 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 432 transitions. [2022-10-15 21:52:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-15 21:52:30,894 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:30,894 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:30,932 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,109 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,110 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,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1680950067, now seen corresponding path program 1 times [2022-10-15 21:52:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:31,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18645237] [2022-10-15 21:52:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,291 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,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:31,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18645237] [2022-10-15 21:52:31,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18645237] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:31,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430111692] [2022-10-15 21:52:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:31,293 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,302 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,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:31,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:31,455 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,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:31,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430111692] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:31,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:31,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069583971] [2022-10-15 21:52:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:31,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:31,458 INFO L87 Difference]: Start difference. First operand 285 states and 432 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:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:31,506 INFO L93 Difference]: Finished difference Result 547 states and 835 transitions. [2022-10-15 21:52:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:31,508 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:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:31,511 INFO L225 Difference]: With dead ends: 547 [2022-10-15 21:52:31,511 INFO L226 Difference]: Without dead ends: 352 [2022-10-15 21:52:31,512 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:31,513 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 88 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1081 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,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1081 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-10-15 21:52:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 295. [2022-10-15 21:52:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 239 states have internal predecessors, (355), 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,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 449 transitions. [2022-10-15 21:52:31,530 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 449 transitions. Word has length 107 [2022-10-15 21:52:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:31,531 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 449 transitions. [2022-10-15 21:52:31,531 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:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 449 transitions. [2022-10-15 21:52:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-10-15 21:52:31,533 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:31,534 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, 1] [2022-10-15 21:52:31,571 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,747 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,748 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,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash -569844177, now seen corresponding path program 1 times [2022-10-15 21:52:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:31,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930147414] [2022-10-15 21:52:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,909 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,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930147414] [2022-10-15 21:52:31,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930147414] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208574496] [2022-10-15 21:52:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:31,911 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,927 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,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:32,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:32,090 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,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:32,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208574496] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:32,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:32,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572962274] [2022-10-15 21:52:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:32,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:32,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:32,093 INFO L87 Difference]: Start difference. First operand 295 states and 449 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, (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,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:32,144 INFO L93 Difference]: Finished difference Result 384 states and 595 transitions. [2022-10-15 21:52:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:32,145 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, (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 108 [2022-10-15 21:52:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:32,148 INFO L225 Difference]: With dead ends: 384 [2022-10-15 21:52:32,148 INFO L226 Difference]: Without dead ends: 383 [2022-10-15 21:52:32,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 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:32,150 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 115 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1123 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,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1123 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,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-10-15 21:52:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 294. [2022-10-15 21:52:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 238 states have internal predecessors, (354), 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,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 448 transitions. [2022-10-15 21:52:32,169 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 448 transitions. Word has length 108 [2022-10-15 21:52:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:32,169 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 448 transitions. [2022-10-15 21:52:32,169 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, (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,170 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 448 transitions. [2022-10-15 21:52:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-15 21:52:32,172 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:32,172 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,207 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,387 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,388 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,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1575850277, now seen corresponding path program 1 times [2022-10-15 21:52:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397420117] [2022-10-15 21:52:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:32,512 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 19 [2022-10-15 21:52:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,586 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,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:32,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397420117] [2022-10-15 21:52:32,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397420117] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:32,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930488939] [2022-10-15 21:52:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:32,588 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,612 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,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:32,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:32,752 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,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930488939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:32,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094765427] [2022-10-15 21:52:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:32,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:32,755 INFO L87 Difference]: Start difference. First operand 294 states and 448 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:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:32,800 INFO L93 Difference]: Finished difference Result 351 states and 537 transitions. [2022-10-15 21:52:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:32,801 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:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:32,804 INFO L225 Difference]: With dead ends: 351 [2022-10-15 21:52:32,804 INFO L226 Difference]: Without dead ends: 350 [2022-10-15 21:52:32,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 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,805 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 83 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1042 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,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1042 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,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-10-15 21:52:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 295. [2022-10-15 21:52:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 239 states have internal predecessors, (355), 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,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 449 transitions. [2022-10-15 21:52:32,822 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 449 transitions. Word has length 115 [2022-10-15 21:52:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:32,822 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 449 transitions. [2022-10-15 21:52:32,822 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:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 449 transitions. [2022-10-15 21:52:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-15 21:52:32,825 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:32,825 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:32,865 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,038 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,038 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,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1606717971, now seen corresponding path program 1 times [2022-10-15 21:52:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:33,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972682333] [2022-10-15 21:52:33,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [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 35 [2022-10-15 21:52:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:33,188 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 77 [2022-10-15 21:52:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,202 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,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:33,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972682333] [2022-10-15 21:52:33,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972682333] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:33,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555617225] [2022-10-15 21:52:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:33,204 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,209 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,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:33,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:33,361 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,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:33,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555617225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:33,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:33,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234234169] [2022-10-15 21:52:33,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:33,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:33,364 INFO L87 Difference]: Start difference. First operand 295 states and 449 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, (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,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:33,414 INFO L93 Difference]: Finished difference Result 386 states and 597 transitions. [2022-10-15 21:52:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:33,415 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, (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 116 [2022-10-15 21:52:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:33,418 INFO L225 Difference]: With dead ends: 386 [2022-10-15 21:52:33,418 INFO L226 Difference]: Without dead ends: 385 [2022-10-15 21:52:33,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 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:33,419 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 111 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1139 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,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1139 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,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-10-15 21:52:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 296. [2022-10-15 21:52:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 240 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:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 450 transitions. [2022-10-15 21:52:33,436 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 450 transitions. Word has length 116 [2022-10-15 21:52:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:33,436 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 450 transitions. [2022-10-15 21:52:33,437 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, (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,437 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 450 transitions. [2022-10-15 21:52:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-10-15 21:52:33,439 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:33,439 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:33,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:33,653 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,654 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,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1464129119, now seen corresponding path program 1 times [2022-10-15 21:52:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:33,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099300076] [2022-10-15 21:52:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,824 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,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099300076] [2022-10-15 21:52:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099300076] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279854905] [2022-10-15 21:52:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:33,828 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,843 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:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:33,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:34,019 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,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279854905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667705066] [2022-10-15 21:52:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:34,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:34,021 INFO L87 Difference]: Start difference. First operand 296 states and 450 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:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:34,147 INFO L93 Difference]: Finished difference Result 643 states and 993 transitions. [2022-10-15 21:52:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:52:34,148 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:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:34,151 INFO L225 Difference]: With dead ends: 643 [2022-10-15 21:52:34,151 INFO L226 Difference]: Without dead ends: 437 [2022-10-15 21:52:34,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 136 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,153 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 213 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:34,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1929 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-10-15 21:52:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 301. [2022-10-15 21:52:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 236 states have (on average 1.5423728813559323) internal successors, (364), 244 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:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 460 transitions. [2022-10-15 21:52:34,170 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 460 transitions. Word has length 117 [2022-10-15 21:52:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:34,171 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 460 transitions. [2022-10-15 21:52:34,171 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:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 460 transitions. [2022-10-15 21:52:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-15 21:52:34,174 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:34,174 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, 1] [2022-10-15 21:52:34,208 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,387 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,387 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,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1856637207, now seen corresponding path program 1 times [2022-10-15 21:52:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:34,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687004163] [2022-10-15 21:52:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,547 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,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:34,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687004163] [2022-10-15 21:52:34,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687004163] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:34,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019999225] [2022-10-15 21:52:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:34,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:34,549 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,571 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,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:34,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:34,733 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,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:34,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019999225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:34,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:34,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533043940] [2022-10-15 21:52:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:34,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:34,736 INFO L87 Difference]: Start difference. First operand 301 states and 460 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, (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,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:34,839 INFO L93 Difference]: Finished difference Result 444 states and 692 transitions. [2022-10-15 21:52:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:52:34,840 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, (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 118 [2022-10-15 21:52:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:34,843 INFO L225 Difference]: With dead ends: 444 [2022-10-15 21:52:34,843 INFO L226 Difference]: Without dead ends: 443 [2022-10-15 21:52:34,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 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:34,845 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 193 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:34,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2097 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-10-15 21:52:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 298. [2022-10-15 21:52:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 234 states have (on average 1.5427350427350428) internal successors, (361), 241 states have internal predecessors, (361), 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,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 457 transitions. [2022-10-15 21:52:34,866 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 457 transitions. Word has length 118 [2022-10-15 21:52:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:34,867 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 457 transitions. [2022-10-15 21:52:34,867 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, (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,867 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 457 transitions. [2022-10-15 21:52:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-10-15 21:52:34,870 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:34,870 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:34,918 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,085 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,085 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,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1684605911, now seen corresponding path program 1 times [2022-10-15 21:52:35,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:35,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004399222] [2022-10-15 21:52:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:52:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,265 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,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004399222] [2022-10-15 21:52:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004399222] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188945831] [2022-10-15 21:52:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:35,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:35,267 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,288 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,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:35,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:35,435 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,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:35,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188945831] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:35,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:35,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422410476] [2022-10-15 21:52:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:35,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:35,437 INFO L87 Difference]: Start difference. First operand 298 states and 457 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:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:35,481 INFO L93 Difference]: Finished difference Result 354 states and 545 transitions. [2022-10-15 21:52:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:35,482 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:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:35,484 INFO L225 Difference]: With dead ends: 354 [2022-10-15 21:52:35,485 INFO L226 Difference]: Without dead ends: 353 [2022-10-15 21:52:35,485 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:35,486 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 80 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:35,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1038 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-10-15 21:52:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 299. [2022-10-15 21:52:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 235 states have (on average 1.5404255319148936) internal successors, (362), 242 states have internal predecessors, (362), 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,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2022-10-15 21:52:35,500 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 123 [2022-10-15 21:52:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:35,501 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2022-10-15 21:52:35,501 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:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2022-10-15 21:52:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-10-15 21:52:35,504 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:35,504 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:35,543 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,717 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,717 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,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash -683175317, now seen corresponding path program 1 times [2022-10-15 21:52:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:35,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119004878] [2022-10-15 21:52:35,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:52:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,873 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,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119004878] [2022-10-15 21:52:35,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119004878] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743617018] [2022-10-15 21:52:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:35,875 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:35,877 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:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:35,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:36,029 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,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:36,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743617018] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:36,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:36,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370790331] [2022-10-15 21:52:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:36,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:36,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:36,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:36,032 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 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,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:36,080 INFO L93 Difference]: Finished difference Result 386 states and 600 transitions. [2022-10-15 21:52:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 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 124 [2022-10-15 21:52:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:36,084 INFO L225 Difference]: With dead ends: 386 [2022-10-15 21:52:36,084 INFO L226 Difference]: Without dead ends: 385 [2022-10-15 21:52:36,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 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,086 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 105 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:36,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1163 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-10-15 21:52:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 300. [2022-10-15 21:52:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 236 states have (on average 1.5381355932203389) internal successors, (363), 243 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:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 459 transitions. [2022-10-15 21:52:36,101 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 459 transitions. Word has length 124 [2022-10-15 21:52:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:36,105 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 459 transitions. [2022-10-15 21:52:36,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 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,105 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 459 transitions. [2022-10-15 21:52:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-15 21:52:36,108 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:36,108 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:36,146 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,322 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,323 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,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1787761069, now seen corresponding path program 1 times [2022-10-15 21:52:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599273373] [2022-10-15 21:52:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,509 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,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:36,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599273373] [2022-10-15 21:52:36,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599273373] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254494810] [2022-10-15 21:52:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:36,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:36,511 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,533 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,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:36,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:36,700 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,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:36,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254494810] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:36,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:36,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608292584] [2022-10-15 21:52:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:36,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:36,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:36,703 INFO L87 Difference]: Start difference. First operand 300 states and 459 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:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:36,823 INFO L93 Difference]: Finished difference Result 650 states and 1010 transitions. [2022-10-15 21:52:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:36,824 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:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:36,831 INFO L225 Difference]: With dead ends: 650 [2022-10-15 21:52:36,831 INFO L226 Difference]: Without dead ends: 440 [2022-10-15 21:52:36,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:36,833 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 232 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:36,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1830 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-10-15 21:52:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 306. [2022-10-15 21:52:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 241 states have (on average 1.5311203319502074) internal successors, (369), 248 states have internal predecessors, (369), 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:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 467 transitions. [2022-10-15 21:52:36,850 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 467 transitions. Word has length 125 [2022-10-15 21:52:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:36,850 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 467 transitions. [2022-10-15 21:52:36,852 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:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 467 transitions. [2022-10-15 21:52:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-15 21:52:36,855 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:36,855 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:36,893 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,068 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,068 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,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -88369235, now seen corresponding path program 1 times [2022-10-15 21:52:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:37,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805961505] [2022-10-15 21:52:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,251 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,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:37,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805961505] [2022-10-15 21:52:37,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805961505] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:37,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328184495] [2022-10-15 21:52:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:37,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:37,253 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,272 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,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:37,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:37,436 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,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328184495] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:37,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:37,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985193362] [2022-10-15 21:52:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:37,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:37,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:37,440 INFO L87 Difference]: Start difference. First operand 306 states and 467 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:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:37,560 INFO L93 Difference]: Finished difference Result 442 states and 689 transitions. [2022-10-15 21:52:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:37,561 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:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:37,564 INFO L225 Difference]: With dead ends: 442 [2022-10-15 21:52:37,564 INFO L226 Difference]: Without dead ends: 441 [2022-10-15 21:52:37,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 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,566 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 184 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:37,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2247 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-10-15 21:52:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 303. [2022-10-15 21:52:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 239 states have (on average 1.5313807531380754) internal successors, (366), 246 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:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 462 transitions. [2022-10-15 21:52:37,582 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 462 transitions. Word has length 125 [2022-10-15 21:52:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:37,583 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 462 transitions. [2022-10-15 21:52:37,583 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:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 462 transitions. [2022-10-15 21:52:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-10-15 21:52:37,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:37,586 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:37,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-10-15 21:52:37,800 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:37,800 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:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash -413981337, now seen corresponding path program 1 times [2022-10-15 21:52:37,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:37,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600731964] [2022-10-15 21:52:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,961 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,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600731964] [2022-10-15 21:52:37,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600731964] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830679347] [2022-10-15 21:52:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:37,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:37,962 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:37,989 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,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:52:38,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:38,138 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,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:38,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830679347] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:38,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:38,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981080846] [2022-10-15 21:52:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:38,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:38,142 INFO L87 Difference]: Start difference. First operand 303 states and 462 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 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:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:38,196 INFO L93 Difference]: Finished difference Result 380 states and 589 transitions. [2022-10-15 21:52:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:38,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2022-10-15 21:52:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:38,202 INFO L225 Difference]: With dead ends: 380 [2022-10-15 21:52:38,202 INFO L226 Difference]: Without dead ends: 379 [2022-10-15 21:52:38,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 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:38,204 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 113 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:38,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1101 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-10-15 21:52:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 300. [2022-10-15 21:52:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.5316455696202531) internal successors, (363), 243 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:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 459 transitions. [2022-10-15 21:52:38,220 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 459 transitions. Word has length 126 [2022-10-15 21:52:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:38,221 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 459 transitions. [2022-10-15 21:52:38,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 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:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 459 transitions. [2022-10-15 21:52:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-15 21:52:38,224 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:38,225 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:38,299 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,438 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,439 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1827085263, now seen corresponding path program 1 times [2022-10-15 21:52:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819274832] [2022-10-15 21:52:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-15 21:52:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,640 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,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:38,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819274832] [2022-10-15 21:52:38,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819274832] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:38,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392506816] [2022-10-15 21:52:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:38,642 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:38,656 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:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:52:38,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:38,874 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,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:38,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392506816] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:38,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-10-15 21:52:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125387838] [2022-10-15 21:52:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:38,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:52:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:52:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:38,877 INFO L87 Difference]: Start difference. First operand 300 states and 459 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:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:39,069 INFO L93 Difference]: Finished difference Result 521 states and 823 transitions. [2022-10-15 21:52:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:52:39,069 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:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:39,070 INFO L225 Difference]: With dead ends: 521 [2022-10-15 21:52:39,070 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:52:39,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 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:39,073 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 323 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:39,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2846 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:52:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:52:39,074 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:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:52:39,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2022-10-15 21:52:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:39,075 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:52:39,075 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:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:52:39,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:52:39,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-10-15 21:52:39,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-10-15 21:52:39,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-10-15 21:52:39,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-10-15 21:52:39,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-10-15 21:52:39,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-10-15 21:52:39,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-10-15 21:52:39,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-10-15 21:52:39,121 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,296 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,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:52:39,683 INFO L902 garLoopResultBuilder]: At program point L119(line 119) the Hoare annotation is: true [2022-10-15 21:52:39,683 INFO L899 garLoopResultBuilder]: For program point L119-1(line 119) no Hoare annotation was computed. [2022-10-15 21:52:39,683 INFO L899 garLoopResultBuilder]: For program point read_history_int8FINAL(lines 104 123) no Hoare annotation was computed. [2022-10-15 21:52:39,683 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-10-15 21:52:39,683 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 117) no Hoare annotation was computed. [2022-10-15 21:52:39,683 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 120) no Hoare annotation was computed. [2022-10-15 21:52:39,683 INFO L899 garLoopResultBuilder]: For program point read_history_int8EXIT(lines 104 123) no Hoare annotation was computed. [2022-10-15 21:52:39,684 INFO L902 garLoopResultBuilder]: At program point read_history_int8ENTRY(lines 104 123) the Hoare annotation is: true [2022-10-15 21:52:39,684 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:39,684 INFO L899 garLoopResultBuilder]: For program point L159-1(line 159) no Hoare annotation was computed. [2022-10-15 21:52:39,684 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 157) no Hoare annotation was computed. [2022-10-15 21:52:39,684 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 160) no Hoare annotation was computed. [2022-10-15 21:52:39,684 INFO L899 garLoopResultBuilder]: For program point read_history_boolFINAL(lines 124 163) no Hoare annotation was computed. [2022-10-15 21:52:39,684 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 147) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 160) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point read_history_boolEXIT(lines 124 163) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L902 garLoopResultBuilder]: At program point read_history_boolENTRY(lines 124 163) the Hoare annotation is: true [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 160) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 157) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 147) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 137) no Hoare annotation was computed. [2022-10-15 21:52:39,685 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 526 537) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L902 garLoopResultBuilder]: At program point assertENTRY(lines 526 537) the Hoare annotation is: true [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point assertEXIT(lines 526 537) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point L533(line 533) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 277) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point L349(line 349) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point L349-2(line 349) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2022-10-15 21:52:39,686 INFO L899 garLoopResultBuilder]: For program point L366-1(line 366) no Hoare annotation was computed. [2022-10-15 21:52:39,687 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 301) no Hoare annotation was computed. [2022-10-15 21:52:39,687 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 426) no Hoare annotation was computed. [2022-10-15 21:52:39,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:52:39,687 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 294) no Hoare annotation was computed. [2022-10-15 21:52:39,687 INFO L902 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: true [2022-10-15 21:52:39,687 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-10-15 21:52:39,687 INFO L902 garLoopResultBuilder]: At program point L367(lines 339 369) the Hoare annotation is: true [2022-10-15 21:52:39,687 INFO L902 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: true [2022-10-15 21:52:39,687 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 175) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 291) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 262) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L902 garLoopResultBuilder]: At program point L467(line 467) the Hoare annotation is: true [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 444 468) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 300) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 468) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 395) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 288) no Hoare annotation was computed. [2022-10-15 21:52:39,688 INFO L902 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: true [2022-10-15 21:52:39,689 INFO L899 garLoopResultBuilder]: For program point L220-1(line 220) no Hoare annotation was computed. [2022-10-15 21:52:39,689 INFO L902 garLoopResultBuilder]: At program point L336(lines 231 338) the Hoare annotation is: true [2022-10-15 21:52:39,689 INFO L899 garLoopResultBuilder]: For program point L303(line 303) no Hoare annotation was computed. [2022-10-15 21:52:39,689 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2022-10-15 21:52:39,689 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 426) no Hoare annotation was computed. [2022-10-15 21:52:39,689 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 223) no Hoare annotation was computed. [2022-10-15 21:52:39,689 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 322) no Hoare annotation was computed. [2022-10-15 21:52:39,689 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:39,689 INFO L902 garLoopResultBuilder]: At program point L304-1(lines 304 322) the Hoare annotation is: true [2022-10-15 21:52:39,690 INFO L899 garLoopResultBuilder]: For program point L271-1(line 271) no Hoare annotation was computed. [2022-10-15 21:52:39,690 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 364) no Hoare annotation was computed. [2022-10-15 21:52:39,690 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 262) no Hoare annotation was computed. [2022-10-15 21:52:39,690 INFO L902 garLoopResultBuilder]: At program point L470(lines 432 472) the Hoare annotation is: true [2022-10-15 21:52:39,690 INFO L902 garLoopResultBuilder]: At program point L305(line 305) the Hoare annotation is: true [2022-10-15 21:52:39,690 INFO L899 garLoopResultBuilder]: For program point L272(lines 272 274) no Hoare annotation was computed. [2022-10-15 21:52:39,690 INFO L899 garLoopResultBuilder]: For program point L305-1(line 305) no Hoare annotation was computed. [2022-10-15 21:52:39,690 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:39,691 INFO L902 garLoopResultBuilder]: At program point L520(line 520) the Hoare annotation is: true [2022-10-15 21:52:39,691 INFO L902 garLoopResultBuilder]: At program point L520-1(lines 507 522) the Hoare annotation is: true [2022-10-15 21:52:39,691 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 395) no Hoare annotation was computed. [2022-10-15 21:52:39,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:52:39,691 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 321) no Hoare annotation was computed. [2022-10-15 21:52:39,691 INFO L899 garLoopResultBuilder]: For program point L273(line 273) no Hoare annotation was computed. [2022-10-15 21:52:39,691 INFO L899 garLoopResultBuilder]: For program point L273-1(line 273) no Hoare annotation was computed. [2022-10-15 21:52:39,691 INFO L902 garLoopResultBuilder]: At program point L174(line 174) the Hoare annotation is: true [2022-10-15 21:52:39,691 INFO L902 garLoopResultBuilder]: At program point L174-1(lines 164 178) the Hoare annotation is: true [2022-10-15 21:52:39,692 INFO L899 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-10-15 21:52:39,692 INFO L902 garLoopResultBuilder]: At program point L422-2(lines 416 426) the Hoare annotation is: true [2022-10-15 21:52:39,692 INFO L899 garLoopResultBuilder]: For program point L323(line 323) no Hoare annotation was computed. [2022-10-15 21:52:39,692 INFO L902 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: true [2022-10-15 21:52:39,692 INFO L899 garLoopResultBuilder]: For program point L224-1(line 224) no Hoare annotation was computed. [2022-10-15 21:52:39,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 277) no Hoare annotation was computed. [2022-10-15 21:52:39,692 INFO L902 garLoopResultBuilder]: At program point L307(line 307) the Hoare annotation is: true [2022-10-15 21:52:39,692 INFO L899 garLoopResultBuilder]: For program point L307-1(line 307) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 335) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 324 335) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L225(lines 225 227) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L902 garLoopResultBuilder]: At program point L258-2(lines 252 262) the Hoare annotation is: true [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 320) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L275(line 275) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-10-15 21:52:39,693 INFO L902 garLoopResultBuilder]: At program point L391-2(lines 385 395) the Hoare annotation is: true [2022-10-15 21:52:39,694 INFO L902 garLoopResultBuilder]: At program point L325(line 325) the Hoare annotation is: true [2022-10-15 21:52:39,694 INFO L899 garLoopResultBuilder]: For program point L325-1(line 325) no Hoare annotation was computed. [2022-10-15 21:52:39,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-10-15 21:52:39,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:52:39,694 INFO L899 garLoopResultBuilder]: For program point L507-2(lines 507 522) no Hoare annotation was computed. [2022-10-15 21:52:39,694 INFO L902 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: true [2022-10-15 21:52:39,694 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 278) no Hoare annotation was computed. [2022-10-15 21:52:39,694 INFO L899 garLoopResultBuilder]: For program point L309-1(line 309) no Hoare annotation was computed. [2022-10-15 21:52:39,695 INFO L895 garLoopResultBuilder]: At program point L276-2(lines 276 278) the Hoare annotation is: (and (<= |ULTIMATE.start_check_~temp_count~0#1| 2) (<= 0 (+ |ULTIMATE.start_check_~temp_count~0#1| 2147483648))) [2022-10-15 21:52:39,695 INFO L895 garLoopResultBuilder]: At program point L524(lines 473 525) the Hoare annotation is: false [2022-10-15 21:52:39,695 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 468) no Hoare annotation was computed. [2022-10-15 21:52:39,695 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 334) no Hoare annotation was computed. [2022-10-15 21:52:39,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-10-15 21:52:39,695 INFO L902 garLoopResultBuilder]: At program point L409(line 409) the Hoare annotation is: true [2022-10-15 21:52:39,695 INFO L899 garLoopResultBuilder]: For program point L409-1(lines 407 430) no Hoare annotation was computed. [2022-10-15 21:52:39,695 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 317) no Hoare annotation was computed. [2022-10-15 21:52:39,696 INFO L899 garLoopResultBuilder]: For program point L277(line 277) no Hoare annotation was computed. [2022-10-15 21:52:39,696 INFO L899 garLoopResultBuilder]: For program point L277-1(line 277) no Hoare annotation was computed. [2022-10-15 21:52:39,696 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-10-15 21:52:39,696 INFO L902 garLoopResultBuilder]: At program point L327(line 327) the Hoare annotation is: true [2022-10-15 21:52:39,696 INFO L902 garLoopResultBuilder]: At program point L360-2(lines 354 364) the Hoare annotation is: true [2022-10-15 21:52:39,696 INFO L899 garLoopResultBuilder]: For program point L327-1(line 327) no Hoare annotation was computed. [2022-10-15 21:52:39,696 INFO L902 garLoopResultBuilder]: At program point L228(lines 204 230) the Hoare annotation is: true [2022-10-15 21:52:39,696 INFO L902 garLoopResultBuilder]: At program point L311(line 311) the Hoare annotation is: true [2022-10-15 21:52:39,696 INFO L899 garLoopResultBuilder]: For program point L311-1(line 311) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L902 garLoopResultBuilder]: At program point L212(line 212) the Hoare annotation is: true [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L427(lines 407 430) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 333) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 468) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L902 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: true [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 376 399) no Hoare annotation was computed. [2022-10-15 21:52:39,697 INFO L899 garLoopResultBuilder]: For program point L411-2(line 411) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 314) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 215) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 468) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L899 garLoopResultBuilder]: For program point L428-1(line 428) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L902 garLoopResultBuilder]: At program point L329(line 329) the Hoare annotation is: true [2022-10-15 21:52:39,698 INFO L895 garLoopResultBuilder]: At program point L296(lines 283 299) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_check_~temp_count~0#1| 2147483648)) [2022-10-15 21:52:39,698 INFO L899 garLoopResultBuilder]: For program point L329-1(line 329) no Hoare annotation was computed. [2022-10-15 21:52:39,698 INFO L902 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: true [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 449) no Hoare annotation was computed. [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 281) no Hoare annotation was computed. [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 282) no Hoare annotation was computed. [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point L280-2(lines 269 300) no Hoare annotation was computed. [2022-10-15 21:52:39,699 INFO L902 garLoopResultBuilder]: At program point L429(lines 401 431) the Hoare annotation is: true [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point L396(lines 376 399) no Hoare annotation was computed. [2022-10-15 21:52:39,699 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 332) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L264(line 264) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 281) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L902 garLoopResultBuilder]: At program point L347(line 347) the Hoare annotation is: true [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L347-1(lines 345 368) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L380-2(line 380) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2022-10-15 21:52:39,700 INFO L899 garLoopResultBuilder]: For program point L397-1(line 397) no Hoare annotation was computed. [2022-10-15 21:52:39,701 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 302) no Hoare annotation was computed. [2022-10-15 21:52:39,701 INFO L902 garLoopResultBuilder]: At program point L265-1(lines 265 302) the Hoare annotation is: true [2022-10-15 21:52:39,701 INFO L902 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: true [2022-10-15 21:52:39,701 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-10-15 21:52:39,701 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2022-10-15 21:52:39,701 INFO L902 garLoopResultBuilder]: At program point L398(lines 370 400) the Hoare annotation is: true [2022-10-15 21:52:39,701 INFO L899 garLoopResultBuilder]: For program point L365(lines 345 368) no Hoare annotation was computed. [2022-10-15 21:52:39,701 INFO L902 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point L266-1(line 266) no Hoare annotation was computed. [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 75 98) no Hoare annotation was computed. [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 91) no Hoare annotation was computed. [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 98) no Hoare annotation was computed. [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 79) no Hoare annotation was computed. [2022-10-15 21:52:39,702 INFO L899 garLoopResultBuilder]: For program point add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-10-15 21:52:39,702 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:39,703 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2022-10-15 21:52:39,703 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:39,703 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-10-15 21:52:39,703 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:39,703 INFO L899 garLoopResultBuilder]: For program point L74-3(lines 74 100) no Hoare annotation was computed. [2022-10-15 21:52:39,703 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-10-15 21:52:39,703 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2022-10-15 21:52:39,703 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 97) no Hoare annotation was computed. [2022-10-15 21:52:39,704 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 98) no Hoare annotation was computed. [2022-10-15 21:52:39,704 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 85) no Hoare annotation was computed. [2022-10-15 21:52:39,704 INFO L899 garLoopResultBuilder]: For program point add_history_typeEXIT(lines 60 103) no Hoare annotation was computed. [2022-10-15 21:52:39,704 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 98) no Hoare annotation was computed. [2022-10-15 21:52:39,704 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:39,704 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2022-10-15 21:52:39,704 INFO L902 garLoopResultBuilder]: At program point add_history_typeENTRY(lines 60 103) the Hoare annotation is: true [2022-10-15 21:52:39,704 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:39,705 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2022-10-15 21:52:39,705 INFO L899 garLoopResultBuilder]: For program point add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-10-15 21:52:39,705 INFO L899 garLoopResultBuilder]: For program point add_history_typeFINAL(lines 60 103) no Hoare annotation was computed. [2022-10-15 21:52:39,705 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 36 38) the Hoare annotation is: true [2022-10-15 21:52:39,705 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-10-15 21:52:39,705 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 36 38) no Hoare annotation was computed. [2022-10-15 21:52:39,705 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 36 38) no Hoare annotation was computed. [2022-10-15 21:52:39,705 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 200) no Hoare annotation was computed. [2022-10-15 21:52:39,706 INFO L899 garLoopResultBuilder]: For program point write_history_boolEXIT(lines 179 203) no Hoare annotation was computed. [2022-10-15 21:52:39,706 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 200) no Hoare annotation was computed. [2022-10-15 21:52:39,706 INFO L902 garLoopResultBuilder]: At program point write_history_boolENTRY(lines 179 203) the Hoare annotation is: true [2022-10-15 21:52:39,706 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:39,706 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 179 203) no Hoare annotation was computed. [2022-10-15 21:52:39,706 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 200) no Hoare annotation was computed. [2022-10-15 21:52:39,710 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] [2022-10-15 21:52:39,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:52:39,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:52:39 BoogieIcfgContainer [2022-10-15 21:52:39,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:52:39,731 INFO L158 Benchmark]: Toolchain (without parser) took 16343.93ms. Allocated memory was 175.1MB in the beginning and 260.0MB in the end (delta: 84.9MB). Free memory was 147.7MB in the beginning and 177.4MB in the end (delta: -29.7MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2022-10-15 21:52:39,731 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 175.1MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:52:39,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.61ms. Allocated memory is still 175.1MB. Free memory was 147.4MB in the beginning and 131.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 21:52:39,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.33ms. Allocated memory is still 175.1MB. Free memory was 131.8MB in the beginning and 129.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:39,732 INFO L158 Benchmark]: Boogie Preprocessor took 52.75ms. Allocated memory is still 175.1MB. Free memory was 129.0MB in the beginning and 126.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:39,733 INFO L158 Benchmark]: RCFGBuilder took 1032.48ms. Allocated memory is still 175.1MB. Free memory was 126.6MB in the beginning and 129.6MB in the end (delta: -3.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-10-15 21:52:39,733 INFO L158 Benchmark]: TraceAbstraction took 14688.42ms. Allocated memory was 175.1MB in the beginning and 260.0MB in the end (delta: 84.9MB). Free memory was 129.1MB in the beginning and 177.4MB in the end (delta: -48.3MB). Peak memory consumption was 128.9MB. Max. memory is 8.0GB. [2022-10-15 21:52:39,735 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.18ms. Allocated memory is still 175.1MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.61ms. Allocated memory is still 175.1MB. Free memory was 147.4MB in the beginning and 131.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.33ms. Allocated memory is still 175.1MB. Free memory was 131.8MB in the beginning and 129.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.75ms. Allocated memory is still 175.1MB. Free memory was 129.0MB in the beginning and 126.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1032.48ms. Allocated memory is still 175.1MB. Free memory was 126.6MB in the beginning and 129.6MB in the end (delta: -3.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14688.42ms. Allocated memory was 175.1MB in the beginning and 260.0MB in the end (delta: 84.9MB). Free memory was 129.1MB in the beginning and 177.4MB in the end (delta: -48.3MB). Peak memory consumption was 128.9MB. 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, 201 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2450 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2160 mSDsluCounter, 26397 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18405 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 7992 mSDtfsCounter, 966 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2508 GetRequests, 2331 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=18, InterpolantAutomatonStates: 116, 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, 21 MinimizatonAttempts, 1109 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 797 PreInvPairs, 933 NumberOfFragments, 171 HoareAnnotationTreeSize, 797 FomulaSimplifications, 2829 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 54 FomulaSimplificationsInter, 208 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3996 NumberOfCodeBlocks, 3996 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3957 ConstructedInterpolants, 0 QuantifiedInterpolants, 5902 SizeOfPredicates, 25 NumberOfNonLiveVariables, 9455 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 39 InterpolantComputations, 21 PerfectInterpolantSequences, 1701/1760 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: 473]: 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: 0 <= temp_count + 2147483648 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 432]: 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) RESULT: Ultimate proved your program to be correct! [2022-10-15 21:52:39,785 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...