./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 22:42:52,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 22:42:52,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 22:42:52,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 22:42:52,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 22:42:52,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 22:42:52,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 22:42:52,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 22:42:52,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 22:42:52,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 22:42:52,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 22:42:52,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 22:42:52,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 22:42:52,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 22:42:52,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 22:42:52,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 22:42:52,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 22:42:52,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 22:42:52,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 22:42:52,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 22:42:52,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 22:42:52,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 22:42:52,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 22:42:52,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 22:42:52,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 22:42:52,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 22:42:52,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 22:42:52,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 22:42:52,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 22:42:52,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 22:42:52,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 22:42:52,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 22:42:52,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 22:42:52,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 22:42:52,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 22:42:52,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 22:42:52,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 22:42:52,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 22:42:52,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 22:42:52,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 22:42:52,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 22:42:52,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-14 22:42:52,751 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 22:42:52,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 22:42:52,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 22:42:52,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 22:42:52,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 22:42:52,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 22:42:52,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 22:42:52,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 22:42:52,753 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 22:42:52,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 22:42:52,754 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 22:42:52,754 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 22:42:52,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-14 22:42:52,755 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 22:42:52,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 22:42:52,756 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 22:42:52,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 22:42:52,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 22:42:52,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 22:42:52,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 22:42:52,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 22:42:52,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 22:42:52,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 22:42:52,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 22:42:52,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 22:42:52,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 22:42:52,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 22:42:52,758 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 22:42:52,759 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2021-12-14 22:42:52,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 22:42:52,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 22:42:52,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 22:42:52,957 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 22:42:52,972 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 22:42:52,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-12-14 22:42:53,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ff67328/08ca490fcd3f42d4ab5ca31441ab58cf/FLAG52b68cb5e [2021-12-14 22:42:53,475 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 22:42:53,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-12-14 22:42:53,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ff67328/08ca490fcd3f42d4ab5ca31441ab58cf/FLAG52b68cb5e [2021-12-14 22:42:53,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ff67328/08ca490fcd3f42d4ab5ca31441ab58cf [2021-12-14 22:42:53,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 22:42:53,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 22:42:53,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 22:42:53,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 22:42:53,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 22:42:53,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532317cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53, skipping insertion in model container [2021-12-14 22:42:53,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 22:42:53,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 22:42:53,648 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/bitvector/byte_add_2-1.i[1168,1181] [2021-12-14 22:42:53,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 22:42:53,696 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 22:42:53,706 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/bitvector/byte_add_2-1.i[1168,1181] [2021-12-14 22:42:53,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 22:42:53,742 INFO L208 MainTranslator]: Completed translation [2021-12-14 22:42:53,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53 WrapperNode [2021-12-14 22:42:53,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 22:42:53,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 22:42:53,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 22:42:53,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 22:42:53,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,777 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-12-14 22:42:53,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 22:42:53,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 22:42:53,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 22:42:53,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 22:42:53,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 22:42:53,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 22:42:53,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 22:42:53,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 22:42:53,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (1/1) ... [2021-12-14 22:42:53,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 22:42:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:53,821 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) [2021-12-14 22:42:53,827 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 [2021-12-14 22:42:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 22:42:53,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 22:42:53,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 22:42:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 22:42:53,893 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 22:42:53,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 22:42:54,069 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 22:42:54,074 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 22:42:54,074 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 22:42:54,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:42:54 BoogieIcfgContainer [2021-12-14 22:42:54,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 22:42:54,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 22:42:54,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 22:42:54,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 22:42:54,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:42:53" (1/3) ... [2021-12-14 22:42:54,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c0486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:42:54, skipping insertion in model container [2021-12-14 22:42:54,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:53" (2/3) ... [2021-12-14 22:42:54,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430c0486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:42:54, skipping insertion in model container [2021-12-14 22:42:54,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:42:54" (3/3) ... [2021-12-14 22:42:54,082 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2021-12-14 22:42:54,085 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 22:42:54,086 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-14 22:42:54,117 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 22:42:54,122 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 22:42:54,122 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-14 22:42:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 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) [2021-12-14 22:42:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 22:42:54,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:54,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 22:42:54,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-14 22:42:54,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661715466] [2021-12-14 22:42:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:54,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:54,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:54,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661715466] [2021-12-14 22:42:54,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661715466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:54,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:54,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-14 22:42:54,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046939965] [2021-12-14 22:42:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:54,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 22:42:54,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:54,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 22:42:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 22:42:54,342 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-12-14 22:42:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:54,365 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-14 22:42:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 22:42:54,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-14 22:42:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:54,373 INFO L225 Difference]: With dead ends: 135 [2021-12-14 22:42:54,374 INFO L226 Difference]: Without dead ends: 69 [2021-12-14 22:42:54,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 22:42:54,379 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:54,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-14 22:42:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-14 22:42:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-14 22:42:54,413 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-14 22:42:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:54,413 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-14 22:42:54,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-12-14 22:42:54,414 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-14 22:42:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 22:42:54,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:54,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:54,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 22:42:54,416 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-14 22:42:54,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:54,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023323081] [2021-12-14 22:42:54,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:54,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:54,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:54,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023323081] [2021-12-14 22:42:54,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023323081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:54,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:54,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:42:54,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972732548] [2021-12-14 22:42:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:54,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:54,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:54,557 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:54,711 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-14 22:42:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:54,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 22:42:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:54,712 INFO L225 Difference]: With dead ends: 145 [2021-12-14 22:42:54,712 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 22:42:54,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:54,714 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:54,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 22:42:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-14 22:42:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 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) [2021-12-14 22:42:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-14 22:42:54,723 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-14 22:42:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:54,723 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-14 22:42:54,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-14 22:42:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 22:42:54,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:54,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:54,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 22:42:54,726 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-14 22:42:54,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:54,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675964771] [2021-12-14 22:42:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:54,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:54,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:54,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675964771] [2021-12-14 22:42:54,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675964771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:54,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:54,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:42:54,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440468532] [2021-12-14 22:42:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:54,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:54,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:54,843 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:54,986 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-12-14 22:42:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 22:42:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:54,988 INFO L225 Difference]: With dead ends: 221 [2021-12-14 22:42:54,988 INFO L226 Difference]: Without dead ends: 164 [2021-12-14 22:42:54,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:42:54,989 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:54,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 281 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-14 22:42:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-12-14 22:42:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 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) [2021-12-14 22:42:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-12-14 22:42:54,996 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-12-14 22:42:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:54,997 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-12-14 22:42:54,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-12-14 22:42:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 22:42:54,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:54,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:54,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 22:42:54,998 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-12-14 22:42:54,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610800309] [2021-12-14 22:42:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:55,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610800309] [2021-12-14 22:42:55,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610800309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:55,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:42:55,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576769095] [2021-12-14 22:42:55,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:55,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:55,044 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,048 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2021-12-14 22:42:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 22:42:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,049 INFO L225 Difference]: With dead ends: 162 [2021-12-14 22:42:55,049 INFO L226 Difference]: Without dead ends: 81 [2021-12-14 22:42:55,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:55,051 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 80 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-14 22:42:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-14 22:42:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 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) [2021-12-14 22:42:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2021-12-14 22:42:55,055 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 23 [2021-12-14 22:42:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,055 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2021-12-14 22:42:55,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2021-12-14 22:42:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 22:42:55,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 22:42:55,057 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1486873965, now seen corresponding path program 1 times [2021-12-14 22:42:55,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470379394] [2021-12-14 22:42:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:55,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470379394] [2021-12-14 22:42:55,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470379394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:55,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:42:55,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390269012] [2021-12-14 22:42:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:55,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:55,093 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,104 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2021-12-14 22:42:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 22:42:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,105 INFO L225 Difference]: With dead ends: 105 [2021-12-14 22:42:55,106 INFO L226 Difference]: Without dead ends: 92 [2021-12-14 22:42:55,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:55,107 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-14 22:42:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-14 22:42:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2021-12-14 22:42:55,112 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 29 [2021-12-14 22:42:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,112 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2021-12-14 22:42:55,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-12-14 22:42:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 22:42:55,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 22:42:55,114 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1796976081, now seen corresponding path program 1 times [2021-12-14 22:42:55,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140495321] [2021-12-14 22:42:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:55,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140495321] [2021-12-14 22:42:55,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140495321] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:55,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:42:55,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929100932] [2021-12-14 22:42:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:55,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:55,218 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,333 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2021-12-14 22:42:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 22:42:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,335 INFO L225 Difference]: With dead ends: 247 [2021-12-14 22:42:55,335 INFO L226 Difference]: Without dead ends: 177 [2021-12-14 22:42:55,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:42:55,336 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 113 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-14 22:42:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2021-12-14 22:42:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 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) [2021-12-14 22:42:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2021-12-14 22:42:55,341 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 29 [2021-12-14 22:42:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,341 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2021-12-14 22:42:55,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2021-12-14 22:42:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 22:42:55,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 22:42:55,342 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 543877549, now seen corresponding path program 1 times [2021-12-14 22:42:55,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134460358] [2021-12-14 22:42:55,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:55,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134460358] [2021-12-14 22:42:55,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134460358] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996141169] [2021-12-14 22:42:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:55,449 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) [2021-12-14 22:42:55,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 22:42:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 22:42:55,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:55,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:55,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996141169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:55,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-14 22:42:55,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72319691] [2021-12-14 22:42:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:55,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:55,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:42:55,698 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2021-12-14 22:42:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,815 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2021-12-14 22:42:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:55,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 22:42:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,816 INFO L225 Difference]: With dead ends: 213 [2021-12-14 22:42:55,816 INFO L226 Difference]: Without dead ends: 159 [2021-12-14 22:42:55,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:42:55,817 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 132 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-14 22:42:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2021-12-14 22:42:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 137 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2021-12-14 22:42:55,822 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 32 [2021-12-14 22:42:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,822 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2021-12-14 22:42:55,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2021-12-14 22:42:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2021-12-14 22:42:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 22:42:55,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 22:42:56,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:56,024 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 372269661, now seen corresponding path program 1 times [2021-12-14 22:42:56,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947820487] [2021-12-14 22:42:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:56,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:56,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:56,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947820487] [2021-12-14 22:42:56,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947820487] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:56,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186320118] [2021-12-14 22:42:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:56,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:56,137 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) [2021-12-14 22:42:56,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 22:42:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:56,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 22:42:56,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:56,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:56,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186320118] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:56,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:56,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 22:42:56,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454894607] [2021-12-14 22:42:56,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:56,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:56,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:56,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:56,298 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2021-12-14 22:42:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:56,436 INFO L93 Difference]: Finished difference Result 316 states and 425 transitions. [2021-12-14 22:42:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 22:42:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:56,437 INFO L225 Difference]: With dead ends: 316 [2021-12-14 22:42:56,438 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 22:42:56,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:56,440 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:56,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 22:42:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 170. [2021-12-14 22:42:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2307692307692308) internal successors, (208), 169 states have internal predecessors, (208), 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) [2021-12-14 22:42:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2021-12-14 22:42:56,456 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 39 [2021-12-14 22:42:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:56,456 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2021-12-14 22:42:56,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2021-12-14 22:42:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2021-12-14 22:42:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 22:42:56,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:56,458 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:56,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:56,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 22:42:56,658 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1104758513, now seen corresponding path program 1 times [2021-12-14 22:42:56,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:56,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353114530] [2021-12-14 22:42:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:56,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 22:42:56,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353114530] [2021-12-14 22:42:56,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353114530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214905182] [2021-12-14 22:42:56,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:56,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:56,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:56,779 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) [2021-12-14 22:42:56,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 22:42:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:56,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 22:42:56,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 22:42:56,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:56,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214905182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:56,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:56,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 22:42:56,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561030466] [2021-12-14 22:42:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:56,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:56,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:56,888 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:56,999 INFO L93 Difference]: Finished difference Result 381 states and 496 transitions. [2021-12-14 22:42:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-14 22:42:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:57,001 INFO L225 Difference]: With dead ends: 381 [2021-12-14 22:42:57,001 INFO L226 Difference]: Without dead ends: 239 [2021-12-14 22:42:57,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:57,002 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:57,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-14 22:42:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 202. [2021-12-14 22:42:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.2139303482587065) internal successors, (244), 201 states have internal predecessors, (244), 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) [2021-12-14 22:42:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 244 transitions. [2021-12-14 22:42:57,007 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 244 transitions. Word has length 46 [2021-12-14 22:42:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:57,008 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 244 transitions. [2021-12-14 22:42:57,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 244 transitions. [2021-12-14 22:42:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-14 22:42:57,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:57,009 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-14 22:42:57,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:57,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:57,226 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2090870759, now seen corresponding path program 1 times [2021-12-14 22:42:57,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:57,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214604444] [2021-12-14 22:42:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:57,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:42:57,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:57,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214604444] [2021-12-14 22:42:57,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214604444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:57,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:57,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 22:42:57,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208107693] [2021-12-14 22:42:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:57,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:57,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:57,252 INFO L87 Difference]: Start difference. First operand 202 states and 244 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:57,256 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2021-12-14 22:42:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-12-14 22:42:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:57,257 INFO L225 Difference]: With dead ends: 239 [2021-12-14 22:42:57,258 INFO L226 Difference]: Without dead ends: 178 [2021-12-14 22:42:57,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:57,258 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:57,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-14 22:42:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2021-12-14 22:42:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 156 states have internal predecessors, (192), 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) [2021-12-14 22:42:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2021-12-14 22:42:57,263 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 53 [2021-12-14 22:42:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:57,263 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2021-12-14 22:42:57,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2021-12-14 22:42:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 22:42:57,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:57,265 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:57,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 22:42:57,265 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1462173614, now seen corresponding path program 1 times [2021-12-14 22:42:57,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:57,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751551753] [2021-12-14 22:42:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:57,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 22:42:57,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:57,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751551753] [2021-12-14 22:42:57,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751551753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:57,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:57,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:42:57,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483629940] [2021-12-14 22:42:57,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:57,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:57,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:57,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:57,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:57,316 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) [2021-12-14 22:42:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:57,349 INFO L93 Difference]: Finished difference Result 409 states and 500 transitions. [2021-12-14 22:42:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:57,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-14 22:42:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:57,351 INFO L225 Difference]: With dead ends: 409 [2021-12-14 22:42:57,351 INFO L226 Difference]: Without dead ends: 280 [2021-12-14 22:42:57,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:57,352 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 55 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:57,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-12-14 22:42:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 198. [2021-12-14 22:42:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.263959390862944) internal successors, (249), 197 states have internal predecessors, (249), 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) [2021-12-14 22:42:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2021-12-14 22:42:57,360 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 62 [2021-12-14 22:42:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:57,360 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2021-12-14 22:42:57,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) [2021-12-14 22:42:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2021-12-14 22:42:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 22:42:57,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:57,363 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 22:42:57,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 22:42:57,364 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash 588810384, now seen corresponding path program 2 times [2021-12-14 22:42:57,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:57,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539430018] [2021-12-14 22:42:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:57,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:42:57,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539430018] [2021-12-14 22:42:57,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539430018] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634419144] [2021-12-14 22:42:57,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 22:42:57,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:57,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:57,440 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) [2021-12-14 22:42:57,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 22:42:57,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 22:42:57,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 22:42:57,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 22:42:57,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-14 22:42:57,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:57,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634419144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:57,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:57,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-14 22:42:57,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475769678] [2021-12-14 22:42:57,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:57,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:42:57,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:42:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:57,637 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2021-12-14 22:42:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:57,895 INFO L93 Difference]: Finished difference Result 861 states and 1118 transitions. [2021-12-14 22:42:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 22:42:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-14 22:42:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:57,898 INFO L225 Difference]: With dead ends: 861 [2021-12-14 22:42:57,898 INFO L226 Difference]: Without dead ends: 643 [2021-12-14 22:42:57,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 22:42:57,899 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 203 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:57,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 458 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 22:42:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-12-14 22:42:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 372. [2021-12-14 22:42:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.2722371967654986) internal successors, (472), 371 states have internal predecessors, (472), 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) [2021-12-14 22:42:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 472 transitions. [2021-12-14 22:42:57,921 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 472 transitions. Word has length 62 [2021-12-14 22:42:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:57,921 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 472 transitions. [2021-12-14 22:42:57,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2021-12-14 22:42:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 472 transitions. [2021-12-14 22:42:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 22:42:57,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:57,922 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 22:42:57,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:58,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:58,126 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:58,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2012788217, now seen corresponding path program 1 times [2021-12-14 22:42:58,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:58,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62389631] [2021-12-14 22:42:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:58,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:42:58,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:58,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62389631] [2021-12-14 22:42:58,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62389631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:58,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134498452] [2021-12-14 22:42:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:58,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:58,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:58,180 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) [2021-12-14 22:42:58,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 22:42:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:58,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 22:42:58,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:42:58,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:42:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:58,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134498452] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:42:58,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:42:58,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 7 [2021-12-14 22:42:58,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284152332] [2021-12-14 22:42:58,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:42:58,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 22:42:58,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 22:42:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:42:58,495 INFO L87 Difference]: Start difference. First operand 372 states and 472 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:58,646 INFO L93 Difference]: Finished difference Result 910 states and 1146 transitions. [2021-12-14 22:42:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:42:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-14 22:42:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:58,648 INFO L225 Difference]: With dead ends: 910 [2021-12-14 22:42:58,649 INFO L226 Difference]: Without dead ends: 573 [2021-12-14 22:42:58,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 22:42:58,649 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 145 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:58,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 189 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-12-14 22:42:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 378. [2021-12-14 22:42:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.2679045092838197) internal successors, (478), 377 states have internal predecessors, (478), 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) [2021-12-14 22:42:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 478 transitions. [2021-12-14 22:42:58,657 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 478 transitions. Word has length 65 [2021-12-14 22:42:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:58,658 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 478 transitions. [2021-12-14 22:42:58,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 478 transitions. [2021-12-14 22:42:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 22:42:58,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:58,659 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-12-14 22:42:58,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:58,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 22:42:58,875 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1236002389, now seen corresponding path program 1 times [2021-12-14 22:42:58,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:58,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109326945] [2021-12-14 22:42:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:58,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 22:42:58,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109326945] [2021-12-14 22:42:58,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109326945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:58,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:58,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 22:42:58,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709225419] [2021-12-14 22:42:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:58,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 22:42:58,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:58,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 22:42:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:42:58,951 INFO L87 Difference]: Start difference. First operand 378 states and 478 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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) [2021-12-14 22:42:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:59,132 INFO L93 Difference]: Finished difference Result 1134 states and 1439 transitions. [2021-12-14 22:42:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:42:59,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-14 22:42:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:59,135 INFO L225 Difference]: With dead ends: 1134 [2021-12-14 22:42:59,135 INFO L226 Difference]: Without dead ends: 781 [2021-12-14 22:42:59,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-14 22:42:59,136 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 161 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:59,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 220 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-12-14 22:42:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 647. [2021-12-14 22:42:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.258513931888545) internal successors, (813), 646 states have internal predecessors, (813), 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) [2021-12-14 22:42:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 813 transitions. [2021-12-14 22:42:59,149 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 813 transitions. Word has length 71 [2021-12-14 22:42:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:59,149 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 813 transitions. [2021-12-14 22:42:59,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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) [2021-12-14 22:42:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 813 transitions. [2021-12-14 22:42:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 22:42:59,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:59,150 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2021-12-14 22:42:59,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 22:42:59,151 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 479236665, now seen corresponding path program 1 times [2021-12-14 22:42:59,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:59,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135930531] [2021-12-14 22:42:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:59,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 22:42:59,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:59,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135930531] [2021-12-14 22:42:59,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135930531] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:59,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952350171] [2021-12-14 22:42:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:59,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:59,189 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) [2021-12-14 22:42:59,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 22:42:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:59,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 22:42:59,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:42:59,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:59,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952350171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:59,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:59,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-14 22:42:59,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397800745] [2021-12-14 22:42:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:59,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:59,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:59,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:59,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:59,395 INFO L87 Difference]: Start difference. First operand 647 states and 813 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2021-12-14 22:42:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:59,500 INFO L93 Difference]: Finished difference Result 1324 states and 1648 transitions. [2021-12-14 22:42:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-14 22:42:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:59,503 INFO L225 Difference]: With dead ends: 1324 [2021-12-14 22:42:59,503 INFO L226 Difference]: Without dead ends: 960 [2021-12-14 22:42:59,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:59,504 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 108 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:59,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 131 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-14 22:42:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 787. [2021-12-14 22:42:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.2582697201017812) internal successors, (989), 786 states have internal predecessors, (989), 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) [2021-12-14 22:42:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 989 transitions. [2021-12-14 22:42:59,540 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 989 transitions. Word has length 71 [2021-12-14 22:42:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:59,540 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 989 transitions. [2021-12-14 22:42:59,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2021-12-14 22:42:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 989 transitions. [2021-12-14 22:42:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 22:42:59,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:59,541 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-12-14 22:42:59,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:59,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 22:42:59,758 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash 796532883, now seen corresponding path program 1 times [2021-12-14 22:42:59,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:59,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466503769] [2021-12-14 22:42:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:59,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 22:42:59,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:59,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466503769] [2021-12-14 22:42:59,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466503769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:59,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:59,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 22:42:59,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142153593] [2021-12-14 22:42:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:59,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 22:42:59,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 22:42:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:42:59,853 INFO L87 Difference]: Start difference. First operand 787 states and 989 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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) [2021-12-14 22:43:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:00,167 INFO L93 Difference]: Finished difference Result 2041 states and 2554 transitions. [2021-12-14 22:43:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 22:43:00,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-12-14 22:43:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:00,170 INFO L225 Difference]: With dead ends: 2041 [2021-12-14 22:43:00,170 INFO L226 Difference]: Without dead ends: 1223 [2021-12-14 22:43:00,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:00,171 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 237 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:00,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 250 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 22:43:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2021-12-14 22:43:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1051. [2021-12-14 22:43:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.259047619047619) internal successors, (1322), 1050 states have internal predecessors, (1322), 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) [2021-12-14 22:43:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1322 transitions. [2021-12-14 22:43:00,189 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1322 transitions. Word has length 77 [2021-12-14 22:43:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:00,189 INFO L470 AbstractCegarLoop]: Abstraction has 1051 states and 1322 transitions. [2021-12-14 22:43:00,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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) [2021-12-14 22:43:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1322 transitions. [2021-12-14 22:43:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 22:43:00,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:00,190 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-12-14 22:43:00,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 22:43:00,190 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash 302771165, now seen corresponding path program 1 times [2021-12-14 22:43:00,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:00,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101914371] [2021-12-14 22:43:00,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:00,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 22:43:00,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:00,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101914371] [2021-12-14 22:43:00,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101914371] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:00,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945130647] [2021-12-14 22:43:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:00,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:00,236 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) [2021-12-14 22:43:00,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 22:43:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:00,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 22:43:00,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 22:43:00,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 22:43:00,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945130647] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:00,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:00,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2021-12-14 22:43:00,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123883986] [2021-12-14 22:43:00,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:00,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 22:43:00,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 22:43:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-14 22:43:00,522 INFO L87 Difference]: Start difference. First operand 1051 states and 1322 transitions. Second operand has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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) [2021-12-14 22:43:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:01,525 INFO L93 Difference]: Finished difference Result 5477 states and 6500 transitions. [2021-12-14 22:43:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-14 22:43:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-12-14 22:43:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:01,537 INFO L225 Difference]: With dead ends: 5477 [2021-12-14 22:43:01,537 INFO L226 Difference]: Without dead ends: 5404 [2021-12-14 22:43:01,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 22:43:01,539 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 646 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:01,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 789 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 22:43:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2021-12-14 22:43:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 1470. [2021-12-14 22:43:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 1.328795098706603) internal successors, (1952), 1469 states have internal predecessors, (1952), 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) [2021-12-14 22:43:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1952 transitions. [2021-12-14 22:43:01,580 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1952 transitions. Word has length 77 [2021-12-14 22:43:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:01,580 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 1952 transitions. [2021-12-14 22:43:01,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 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) [2021-12-14 22:43:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1952 transitions. [2021-12-14 22:43:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:01,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:01,582 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:01,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:01,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:01,798 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-12-14 22:43:01,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:01,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554830265] [2021-12-14 22:43:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:01,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 22:43:01,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:01,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554830265] [2021-12-14 22:43:01,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554830265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:01,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:01,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 22:43:01,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009308828] [2021-12-14 22:43:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:01,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:01,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:01,854 INFO L87 Difference]: Start difference. First operand 1470 states and 1952 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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) [2021-12-14 22:43:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:01,932 INFO L93 Difference]: Finished difference Result 3683 states and 4688 transitions. [2021-12-14 22:43:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 22:43:01,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:01,937 INFO L225 Difference]: With dead ends: 3683 [2021-12-14 22:43:01,937 INFO L226 Difference]: Without dead ends: 2250 [2021-12-14 22:43:01,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:01,940 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 221 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:01,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 226 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2021-12-14 22:43:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1698. [2021-12-14 22:43:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 1.2286387743076017) internal successors, (2085), 1697 states have internal predecessors, (2085), 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) [2021-12-14 22:43:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2085 transitions. [2021-12-14 22:43:01,979 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2085 transitions. Word has length 83 [2021-12-14 22:43:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:01,980 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 2085 transitions. [2021-12-14 22:43:01,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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) [2021-12-14 22:43:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2085 transitions. [2021-12-14 22:43:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:01,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:01,981 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:01,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 22:43:01,982 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -45908259, now seen corresponding path program 1 times [2021-12-14 22:43:01,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:01,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928615775] [2021-12-14 22:43:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:01,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 22:43:02,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:02,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928615775] [2021-12-14 22:43:02,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928615775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:02,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:02,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 22:43:02,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859814779] [2021-12-14 22:43:02,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:02,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 22:43:02,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 22:43:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:02,069 INFO L87 Difference]: Start difference. First operand 1698 states and 2085 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:02,352 INFO L93 Difference]: Finished difference Result 3581 states and 4374 transitions. [2021-12-14 22:43:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:43:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:02,360 INFO L225 Difference]: With dead ends: 3581 [2021-12-14 22:43:02,360 INFO L226 Difference]: Without dead ends: 3466 [2021-12-14 22:43:02,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 22:43:02,361 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 329 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:02,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 623 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 22:43:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2021-12-14 22:43:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 1703. [2021-12-14 22:43:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 1.227967097532315) internal successors, (2090), 1702 states have internal predecessors, (2090), 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) [2021-12-14 22:43:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2090 transitions. [2021-12-14 22:43:02,404 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2090 transitions. Word has length 83 [2021-12-14 22:43:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:02,405 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 2090 transitions. [2021-12-14 22:43:02,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2090 transitions. [2021-12-14 22:43:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:02,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:02,406 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 22:43:02,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 22:43:02,407 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash -923892381, now seen corresponding path program 1 times [2021-12-14 22:43:02,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742838519] [2021-12-14 22:43:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:02,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 22:43:02,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:02,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742838519] [2021-12-14 22:43:02,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742838519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:02,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:02,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 22:43:02,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074363241] [2021-12-14 22:43:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:02,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 22:43:02,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 22:43:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:02,468 INFO L87 Difference]: Start difference. First operand 1703 states and 2090 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-12-14 22:43:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:02,676 INFO L93 Difference]: Finished difference Result 3118 states and 3817 transitions. [2021-12-14 22:43:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:43:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:02,681 INFO L225 Difference]: With dead ends: 3118 [2021-12-14 22:43:02,681 INFO L226 Difference]: Without dead ends: 2105 [2021-12-14 22:43:02,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-14 22:43:02,683 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 168 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:02,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 232 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 22:43:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2021-12-14 22:43:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1889. [2021-12-14 22:43:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.2213983050847457) internal successors, (2306), 1888 states have internal predecessors, (2306), 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) [2021-12-14 22:43:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2306 transitions. [2021-12-14 22:43:02,714 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2306 transitions. Word has length 83 [2021-12-14 22:43:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:02,715 INFO L470 AbstractCegarLoop]: Abstraction has 1889 states and 2306 transitions. [2021-12-14 22:43:02,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-12-14 22:43:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2306 transitions. [2021-12-14 22:43:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:02,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:02,716 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 22:43:02,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 22:43:02,717 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1662068397, now seen corresponding path program 1 times [2021-12-14 22:43:02,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:02,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892387365] [2021-12-14 22:43:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:02,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:43:02,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:02,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892387365] [2021-12-14 22:43:02,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892387365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:02,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:02,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 22:43:02,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647490727] [2021-12-14 22:43:02,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:02,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 22:43:02,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 22:43:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:02,777 INFO L87 Difference]: Start difference. First operand 1889 states and 2306 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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) [2021-12-14 22:43:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:03,038 INFO L93 Difference]: Finished difference Result 3473 states and 4225 transitions. [2021-12-14 22:43:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 22:43:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:03,043 INFO L225 Difference]: With dead ends: 3473 [2021-12-14 22:43:03,043 INFO L226 Difference]: Without dead ends: 2269 [2021-12-14 22:43:03,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:03,045 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 287 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:03,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 208 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 22:43:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2021-12-14 22:43:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1665. [2021-12-14 22:43:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.2295673076923077) internal successors, (2046), 1664 states have internal predecessors, (2046), 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) [2021-12-14 22:43:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2046 transitions. [2021-12-14 22:43:03,086 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2046 transitions. Word has length 83 [2021-12-14 22:43:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:03,086 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2046 transitions. [2021-12-14 22:43:03,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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) [2021-12-14 22:43:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2046 transitions. [2021-12-14 22:43:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:03,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:03,088 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:03,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 22:43:03,088 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash 335021134, now seen corresponding path program 1 times [2021-12-14 22:43:03,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:03,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343529755] [2021-12-14 22:43:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:03,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-14 22:43:03,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343529755] [2021-12-14 22:43:03,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343529755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186310399] [2021-12-14 22:43:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:03,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:03,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:03,148 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) [2021-12-14 22:43:03,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 22:43:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:03,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 22:43:03,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 22:43:03,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 22:43:03,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186310399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:03,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:03,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-14 22:43:03,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120767800] [2021-12-14 22:43:03,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:03,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 22:43:03,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 22:43:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:03,586 INFO L87 Difference]: Start difference. First operand 1665 states and 2046 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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) [2021-12-14 22:43:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:03,702 INFO L93 Difference]: Finished difference Result 2948 states and 3640 transitions. [2021-12-14 22:43:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:03,706 INFO L225 Difference]: With dead ends: 2948 [2021-12-14 22:43:03,708 INFO L226 Difference]: Without dead ends: 1286 [2021-12-14 22:43:03,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2021-12-14 22:43:03,719 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 300 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:03,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 124 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-12-14 22:43:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1158. [2021-12-14 22:43:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.2359550561797752) internal successors, (1430), 1157 states have internal predecessors, (1430), 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) [2021-12-14 22:43:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1430 transitions. [2021-12-14 22:43:03,752 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1430 transitions. Word has length 83 [2021-12-14 22:43:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:03,753 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 1430 transitions. [2021-12-14 22:43:03,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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) [2021-12-14 22:43:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1430 transitions. [2021-12-14 22:43:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-14 22:43:03,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:03,754 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:03,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:03,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 22:43:03,967 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash 6193209, now seen corresponding path program 1 times [2021-12-14 22:43:03,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:03,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761060258] [2021-12-14 22:43:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:03,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-14 22:43:04,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:04,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761060258] [2021-12-14 22:43:04,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761060258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:04,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:04,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 22:43:04,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142538976] [2021-12-14 22:43:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:04,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 22:43:04,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:04,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 22:43:04,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:04,060 INFO L87 Difference]: Start difference. First operand 1158 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2021-12-14 22:43:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:04,477 INFO L93 Difference]: Finished difference Result 2520 states and 3083 transitions. [2021-12-14 22:43:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 22:43:04,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-14 22:43:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:04,483 INFO L225 Difference]: With dead ends: 2520 [2021-12-14 22:43:04,483 INFO L226 Difference]: Without dead ends: 2405 [2021-12-14 22:43:04,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 22:43:04,484 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 437 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:04,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 928 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 22:43:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2021-12-14 22:43:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1151. [2021-12-14 22:43:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.2365217391304348) internal successors, (1422), 1150 states have internal predecessors, (1422), 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) [2021-12-14 22:43:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1422 transitions. [2021-12-14 22:43:04,511 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1422 transitions. Word has length 85 [2021-12-14 22:43:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:04,512 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1422 transitions. [2021-12-14 22:43:04,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2021-12-14 22:43:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1422 transitions. [2021-12-14 22:43:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-14 22:43:04,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:04,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:04,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 22:43:04,513 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2021-12-14 22:43:04,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:04,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650731089] [2021-12-14 22:43:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:04,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-14 22:43:04,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650731089] [2021-12-14 22:43:04,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650731089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:04,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588555102] [2021-12-14 22:43:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:04,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:04,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:04,605 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) [2021-12-14 22:43:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 22:43:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:04,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 22:43:04,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 0 refuted. 3 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-14 22:43:24,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-14 22:43:24,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588555102] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:24,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:24,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2021-12-14 22:43:24,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033106767] [2021-12-14 22:43:24,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:24,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 22:43:24,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 22:43:24,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=145, Unknown=3, NotChecked=0, Total=210 [2021-12-14 22:43:24,367 INFO L87 Difference]: Start difference. First operand 1151 states and 1422 transitions. Second operand has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 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) [2021-12-14 22:43:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:25,025 INFO L93 Difference]: Finished difference Result 2199 states and 2682 transitions. [2021-12-14 22:43:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 22:43:25,025 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-12-14 22:43:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:25,029 INFO L225 Difference]: With dead ends: 2199 [2021-12-14 22:43:25,029 INFO L226 Difference]: Without dead ends: 1812 [2021-12-14 22:43:25,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 172 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=140, Invalid=363, Unknown=3, NotChecked=0, Total=506 [2021-12-14 22:43:25,030 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 316 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:25,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 678 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 295 Invalid, 0 Unknown, 135 Unchecked, 0.3s Time] [2021-12-14 22:43:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-12-14 22:43:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1178. [2021-12-14 22:43:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.231945624468989) internal successors, (1450), 1177 states have internal predecessors, (1450), 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) [2021-12-14 22:43:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1450 transitions. [2021-12-14 22:43:25,055 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1450 transitions. Word has length 89 [2021-12-14 22:43:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:25,055 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 1450 transitions. [2021-12-14 22:43:25,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 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) [2021-12-14 22:43:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1450 transitions. [2021-12-14 22:43:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 22:43:25,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:25,057 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:25,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:25,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 22:43:25,274 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1585272271, now seen corresponding path program 1 times [2021-12-14 22:43:25,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:25,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723775823] [2021-12-14 22:43:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:25,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 22:43:25,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:25,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723775823] [2021-12-14 22:43:25,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723775823] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:25,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068949162] [2021-12-14 22:43:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:25,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:25,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:25,432 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) [2021-12-14 22:43:25,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 22:43:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:25,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 22:43:25,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 22:43:25,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 22:43:26,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068949162] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:26,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:26,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-14 22:43:26,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849892015] [2021-12-14 22:43:26,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:26,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 22:43:26,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:26,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 22:43:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-14 22:43:26,094 INFO L87 Difference]: Start difference. First operand 1178 states and 1450 transitions. Second operand has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 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) [2021-12-14 22:43:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:26,472 INFO L93 Difference]: Finished difference Result 2507 states and 3049 transitions. [2021-12-14 22:43:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 22:43:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-12-14 22:43:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:26,483 INFO L225 Difference]: With dead ends: 2507 [2021-12-14 22:43:26,483 INFO L226 Difference]: Without dead ends: 1379 [2021-12-14 22:43:26,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-12-14 22:43:26,484 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 436 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:26,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 827 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 22:43:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2021-12-14 22:43:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 939. [2021-12-14 22:43:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.251599147121535) internal successors, (1174), 938 states have internal predecessors, (1174), 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) [2021-12-14 22:43:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1174 transitions. [2021-12-14 22:43:26,504 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1174 transitions. Word has length 91 [2021-12-14 22:43:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:26,504 INFO L470 AbstractCegarLoop]: Abstraction has 939 states and 1174 transitions. [2021-12-14 22:43:26,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 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) [2021-12-14 22:43:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1174 transitions. [2021-12-14 22:43:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 22:43:26,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:26,508 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:26,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-14 22:43:26,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-14 22:43:26,723 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash 365632685, now seen corresponding path program 2 times [2021-12-14 22:43:26,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:26,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736030312] [2021-12-14 22:43:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:26,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:43:26,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:26,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736030312] [2021-12-14 22:43:26,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736030312] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:26,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738665043] [2021-12-14 22:43:26,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 22:43:26,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:26,836 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) [2021-12-14 22:43:26,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 22:43:26,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 22:43:26,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 22:43:26,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 22:43:26,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:43:27,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:43:27,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738665043] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:27,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:27,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-12-14 22:43:27,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712613156] [2021-12-14 22:43:27,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:27,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 22:43:27,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 22:43:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-14 22:43:27,819 INFO L87 Difference]: Start difference. First operand 939 states and 1174 transitions. Second operand has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:29,068 INFO L93 Difference]: Finished difference Result 4126 states and 4779 transitions. [2021-12-14 22:43:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 22:43:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-12-14 22:43:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:29,074 INFO L225 Difference]: With dead ends: 4126 [2021-12-14 22:43:29,075 INFO L226 Difference]: Without dead ends: 2887 [2021-12-14 22:43:29,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 22:43:29,077 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 981 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:29,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [981 Valid, 1361 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 22:43:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2021-12-14 22:43:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 312. [2021-12-14 22:43:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.2540192926045015) internal successors, (390), 311 states have internal predecessors, (390), 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) [2021-12-14 22:43:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 390 transitions. [2021-12-14 22:43:29,091 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 390 transitions. Word has length 91 [2021-12-14 22:43:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:29,091 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 390 transitions. [2021-12-14 22:43:29,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 390 transitions. [2021-12-14 22:43:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-14 22:43:29,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:29,092 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:29,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:29,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-14 22:43:29,308 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-12-14 22:43:29,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:29,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076387572] [2021-12-14 22:43:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:29,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 22:43:29,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 22:43:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 22:43:29,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 22:43:29,423 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 22:43:29,423 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-14 22:43:29,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-14 22:43:29,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-14 22:43:29,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-14 22:43:29,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-14 22:43:29,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-14 22:43:29,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-14 22:43:29,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-14 22:43:29,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-14 22:43:29,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-14 22:43:29,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-14 22:43:29,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-14 22:43:29,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-14 22:43:29,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-14 22:43:29,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-14 22:43:29,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-14 22:43:29,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-14 22:43:29,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-14 22:43:29,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-14 22:43:29,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-14 22:43:29,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-14 22:43:29,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-14 22:43:29,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-14 22:43:29,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-14 22:43:29,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-14 22:43:29,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-14 22:43:29,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 22:43:29,435 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-12-14 22:43:29,437 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 22:43:29,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:43:29 BoogieIcfgContainer [2021-12-14 22:43:29,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 22:43:29,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 22:43:29,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 22:43:29,520 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 22:43:29,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:42:54" (3/4) ... [2021-12-14 22:43:29,522 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 22:43:29,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 22:43:29,524 INFO L158 Benchmark]: Toolchain (without parser) took 36016.65ms. Allocated memory was 109.1MB in the beginning and 209.7MB in the end (delta: 100.7MB). Free memory was 74.9MB in the beginning and 71.2MB in the end (delta: 3.7MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2021-12-14 22:43:29,524 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 22:43:29,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.22ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 82.0MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 22:43:29,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.37ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 22:43:29,524 INFO L158 Benchmark]: Boogie Preprocessor took 17.08ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 22:43:29,525 INFO L158 Benchmark]: RCFGBuilder took 280.59ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 64.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 22:43:29,526 INFO L158 Benchmark]: TraceAbstraction took 35442.16ms. Allocated memory was 109.1MB in the beginning and 209.7MB in the end (delta: 100.7MB). Free memory was 63.7MB in the beginning and 71.2MB in the end (delta: -7.5MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2021-12-14 22:43:29,527 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 209.7MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 22:43:29,531 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.15ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.22ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 82.0MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.37ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.08ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.59ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 64.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35442.16ms. Allocated memory was 109.1MB in the beginning and 209.7MB in the end (delta: 100.7MB). Free memory was 63.7MB in the beginning and 71.2MB in the end (delta: -7.5MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 209.7MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=4043440128] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L83] COND TRUE i < na VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4043440128] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4043440128] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4043440128] [L89] COND TRUE i < nb VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4043440128] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4043440128] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4043440128] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4043440128] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4043440128] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4043440128] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=4043440128] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=4043440128] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L83] COND TRUE i < na VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129] [L89] COND TRUE i < nb VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4043440128, r1=4043440129] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4043440128, r1=4043440129] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=4043440128, r1=4043440129] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=4043440128, r1=4043440129] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=4043440128, r1=4043440129] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129, r2=4043440130] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129, r2=4043440130] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129, r2=4043440130] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L83] COND TRUE i < na VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4043440128, r1=4043440129, r2=4043440130] [L89] COND TRUE i < nb VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4043440128, r1=4043440129, r2=4043440130] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4043440128, r1=4043440129, r2=4043440130] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4043440128, r1=4043440129, r2=4043440130] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4043440128, r1=4043440129, r2=4043440130] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4043440128, r1=4043440129, r2=4043440130] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L116] r1 << 8U VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L116] r2 << 16U VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L116] r3 << 24U VAL [\old(a)=4043440127, \old(b)=234770789, a=4043440127, a0=4043440127, a1=15794687, a2=61697, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5522 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5522 mSDsluCounter, 9152 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 6433 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5422 IncrementalHoareTripleChecker+Invalid, 6120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 2719 mSDtfsCounter, 5422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1545 GetRequests, 1291 SyntacticMatches, 20 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1889occurred in iteration=20, InterpolantAutomatonStates: 217, 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, 26 MinimizatonAttempts, 13386 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 2391 NumberOfCodeBlocks, 2391 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2743 ConstructedInterpolants, 28 QuantifiedInterpolants, 12004 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1766 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 2144/2411 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 22:43:29,583 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample