./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-19 15:13:38,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 15:13:38,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 15:13:38,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 15:13:38,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 15:13:38,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 15:13:38,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 15:13:38,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 15:13:38,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 15:13:38,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 15:13:38,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 15:13:38,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 15:13:38,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 15:13:38,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 15:13:38,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 15:13:38,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 15:13:38,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 15:13:38,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 15:13:38,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 15:13:38,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 15:13:38,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 15:13:38,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 15:13:38,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 15:13:38,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 15:13:38,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 15:13:38,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 15:13:38,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 15:13:38,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 15:13:38,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 15:13:38,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 15:13:38,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 15:13:38,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 15:13:38,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 15:13:38,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 15:13:38,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 15:13:38,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 15:13:38,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 15:13:38,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 15:13:38,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 15:13:38,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 15:13:38,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 15:13:38,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-19 15:13:38,554 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 15:13:38,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 15:13:38,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 15:13:38,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 15:13:38,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 15:13:38,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 15:13:38,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 15:13:38,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 15:13:38,563 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 15:13:38,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 15:13:38,564 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 15:13:38,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 15:13:38,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 15:13:38,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 15:13:38,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 15:13:38,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-19 15:13:38,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 15:13:38,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-19 15:13:38,566 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-19 15:13:38,570 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 15:13:38,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 15:13:38,570 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 15:13:38,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-19 15:13:38,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 15:13:38,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 15:13:38,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 15:13:38,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 15:13:38,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 15:13:38,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 15:13:38,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-19 15:13:38,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 15:13:38,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 15:13:38,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-19 15:13:38,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 15:13:38,573 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-19 15:13:38,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 15:13:38,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 15:13:38,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 15:13:38,814 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 15:13:38,814 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 15:13:38,816 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-19 15:13:38,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229660525/19dc5684e8994df189988735c4667d3b/FLAG2916a89ee [2021-12-19 15:13:39,258 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 15:13:39,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-12-19 15:13:39,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229660525/19dc5684e8994df189988735c4667d3b/FLAG2916a89ee [2021-12-19 15:13:39,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229660525/19dc5684e8994df189988735c4667d3b [2021-12-19 15:13:39,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 15:13:39,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 15:13:39,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 15:13:39,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 15:13:39,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 15:13:39,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ca7c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39, skipping insertion in model container [2021-12-19 15:13:39,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 15:13:39,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 15:13:39,450 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-19 15:13:39,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 15:13:39,487 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 15:13:39,497 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-19 15:13:39,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 15:13:39,535 INFO L208 MainTranslator]: Completed translation [2021-12-19 15:13:39,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39 WrapperNode [2021-12-19 15:13:39,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 15:13:39,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 15:13:39,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 15:13:39,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 15:13:39,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,568 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-12-19 15:13:39,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 15:13:39,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 15:13:39,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 15:13:39,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 15:13:39,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 15:13:39,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 15:13:39,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 15:13:39,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 15:13:39,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (1/1) ... [2021-12-19 15:13:39,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 15:13:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:39,631 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-19 15:13:39,633 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-19 15:13:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 15:13:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 15:13:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 15:13:39,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 15:13:39,703 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 15:13:39,705 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 15:13:39,957 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 15:13:39,963 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 15:13:39,964 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-19 15:13:39,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:13:39 BoogieIcfgContainer [2021-12-19 15:13:39,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 15:13:39,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 15:13:39,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 15:13:39,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 15:13:39,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:13:39" (1/3) ... [2021-12-19 15:13:39,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93685e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:13:39, skipping insertion in model container [2021-12-19 15:13:39,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:13:39" (2/3) ... [2021-12-19 15:13:39,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93685e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:13:39, skipping insertion in model container [2021-12-19 15:13:39,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:13:39" (3/3) ... [2021-12-19 15:13:39,984 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2021-12-19 15:13:39,988 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 15:13:39,989 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-19 15:13:40,028 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 15:13:40,034 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-19 15:13:40,034 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-19 15:13:40,047 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-19 15:13:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-19 15:13:40,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:40,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-19 15:13:40,061 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-19 15:13:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-19 15:13:40,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:40,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422704917] [2021-12-19 15:13:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:40,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:40,177 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-19 15:13:40,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:40,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422704917] [2021-12-19 15:13:40,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422704917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:40,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:40,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-19 15:13:40,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618374053] [2021-12-19 15:13:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:40,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-19 15:13:40,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-19 15:13:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-19 15:13:40,210 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-19 15:13:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:40,229 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-19 15:13:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-19 15:13:40,231 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-19 15:13:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:40,239 INFO L225 Difference]: With dead ends: 135 [2021-12-19 15:13:40,239 INFO L226 Difference]: Without dead ends: 69 [2021-12-19 15:13:40,242 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-19 15:13:40,245 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-19 15:13:40,246 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-19 15:13:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-19 15:13:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-19 15:13:40,282 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-19 15:13:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-19 15:13:40,290 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-19 15:13:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:40,290 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-19 15:13:40,291 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-19 15:13:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-19 15:13:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-19 15:13:40,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:40,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 15:13:40,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-19 15:13:40,293 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-19 15:13:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-19 15:13:40,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:40,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090974591] [2021-12-19 15:13:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:40,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:40,397 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-19 15:13:40,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:40,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090974591] [2021-12-19 15:13:40,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090974591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:40,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:40,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 15:13:40,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456606384] [2021-12-19 15:13:40,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:40,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 15:13:40,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 15:13:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 15:13:40,400 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-19 15:13:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:40,543 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-19 15:13:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 15:13:40,543 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-19 15:13:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:40,548 INFO L225 Difference]: With dead ends: 145 [2021-12-19 15:13:40,548 INFO L226 Difference]: Without dead ends: 98 [2021-12-19 15:13:40,553 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-19 15:13:40,554 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-19 15:13:40,555 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-19 15:13:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-19 15:13:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-19 15:13:40,573 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-19 15:13:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-19 15:13:40,578 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-19 15:13:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:40,578 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-19 15:13:40,579 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-19 15:13:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-19 15:13:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-19 15:13:40,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:40,580 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-19 15:13:40,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-19 15:13:40,581 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-19 15:13:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-19 15:13:40,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:40,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848097815] [2021-12-19 15:13:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:40,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:40,690 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-19 15:13:40,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:40,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848097815] [2021-12-19 15:13:40,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848097815] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:40,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:40,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 15:13:40,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483333224] [2021-12-19 15:13:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:40,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:40,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 15:13:40,693 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-19 15:13:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:40,858 INFO L93 Difference]: Finished difference Result 238 states and 317 transitions. [2021-12-19 15:13:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:40,859 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-19 15:13:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:40,864 INFO L225 Difference]: With dead ends: 238 [2021-12-19 15:13:40,864 INFO L226 Difference]: Without dead ends: 174 [2021-12-19 15:13:40,865 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-19 15:13:40,866 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 127 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:40,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 291 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 15:13:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-19 15:13:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 107. [2021-12-19 15:13:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 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-19 15:13:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2021-12-19 15:13:40,874 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 20 [2021-12-19 15:13:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:40,874 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2021-12-19 15:13:40,874 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-19 15:13:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2021-12-19 15:13:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-19 15:13:40,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:40,875 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-19 15:13:40,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-19 15:13:40,876 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-19 15:13:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 75768748, now seen corresponding path program 1 times [2021-12-19 15:13:40,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:40,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771270082] [2021-12-19 15:13:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:40,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:41,003 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-19 15:13:41,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:41,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771270082] [2021-12-19 15:13:41,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771270082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:41,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:41,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 15:13:41,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218188046] [2021-12-19 15:13:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:41,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:41,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:41,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:41,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 15:13:41,005 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-19 15:13:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:41,182 INFO L93 Difference]: Finished difference Result 237 states and 315 transitions. [2021-12-19 15:13:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-19 15:13:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:41,185 INFO L225 Difference]: With dead ends: 237 [2021-12-19 15:13:41,185 INFO L226 Difference]: Without dead ends: 180 [2021-12-19 15:13:41,187 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-19 15:13:41,196 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.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:41,197 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.2s Time] [2021-12-19 15:13:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-19 15:13:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 120. [2021-12-19 15:13:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 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-19 15:13:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2021-12-19 15:13:41,211 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2021-12-19 15:13:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:41,212 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2021-12-19 15:13:41,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-19 15:13:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2021-12-19 15:13:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-19 15:13:41,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:41,215 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] [2021-12-19 15:13:41,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-19 15:13:41,215 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-19 15:13:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2021-12-19 15:13:41,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:41,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018557035] [2021-12-19 15:13:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:41,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:41,271 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-19 15:13:41,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:41,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018557035] [2021-12-19 15:13:41,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018557035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:41,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:41,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 15:13:41,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305881766] [2021-12-19 15:13:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:41,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 15:13:41,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:41,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 15:13:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 15:13:41,273 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-19 15:13:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:41,278 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2021-12-19 15:13:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 15:13:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2021-12-19 15:13:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:41,279 INFO L225 Difference]: With dead ends: 178 [2021-12-19 15:13:41,279 INFO L226 Difference]: Without dead ends: 86 [2021-12-19 15:13:41,280 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-19 15:13:41,280 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 77 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 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-19 15:13:41,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 15:13:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-19 15:13:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-19 15:13:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 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-19 15:13:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2021-12-19 15:13:41,286 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 26 [2021-12-19 15:13:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:41,286 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2021-12-19 15:13:41,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-19 15:13:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2021-12-19 15:13:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-19 15:13:41,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:41,287 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-19 15:13:41,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-19 15:13:41,287 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-19 15:13:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1554994799, now seen corresponding path program 1 times [2021-12-19 15:13:41,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:41,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777458049] [2021-12-19 15:13:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:41,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:41,357 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-19 15:13:41,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:41,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777458049] [2021-12-19 15:13:41,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777458049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:41,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:41,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 15:13:41,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602242635] [2021-12-19 15:13:41,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:41,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 15:13:41,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:41,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 15:13:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 15:13:41,361 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-19 15:13:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:41,370 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2021-12-19 15:13:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 15:13:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-19 15:13:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:41,379 INFO L225 Difference]: With dead ends: 110 [2021-12-19 15:13:41,379 INFO L226 Difference]: Without dead ends: 97 [2021-12-19 15:13:41,380 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-19 15:13:41,381 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-19 15:13:41,382 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-19 15:13:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-19 15:13:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-19 15:13:41,400 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-19 15:13:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2021-12-19 15:13:41,402 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 32 [2021-12-19 15:13:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:41,403 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2021-12-19 15:13:41,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-19 15:13:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2021-12-19 15:13:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-19 15:13:41,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:41,405 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-19 15:13:41,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-19 15:13:41,405 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-19 15:13:41,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash 543877549, now seen corresponding path program 1 times [2021-12-19 15:13:41,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:41,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147730300] [2021-12-19 15:13:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:41,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:41,484 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-19 15:13:41,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147730300] [2021-12-19 15:13:41,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147730300] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274837644] [2021-12-19 15:13:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:41,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:41,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:41,487 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-19 15:13:41,519 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-19 15:13:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:41,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 15:13:41,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:41,761 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-19 15:13:41,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 15:13:41,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274837644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:41,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 15:13:41,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-19 15:13:41,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791791609] [2021-12-19 15:13:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:41,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:41,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-19 15:13:41,763 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-19 15:13:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:41,937 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2021-12-19 15:13:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:41,938 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-19 15:13:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:41,939 INFO L225 Difference]: With dead ends: 213 [2021-12-19 15:13:41,939 INFO L226 Difference]: Without dead ends: 159 [2021-12-19 15:13:41,939 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-19 15:13:41,940 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.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:41,940 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.2s Time] [2021-12-19 15:13:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-19 15:13:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2021-12-19 15:13:41,945 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-19 15:13:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2021-12-19 15:13:41,946 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 32 [2021-12-19 15:13:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:41,946 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2021-12-19 15:13:41,946 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-19 15:13:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2021-12-19 15:13:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-19 15:13:41,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:41,947 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-19 15:13:41,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-19 15:13:42,159 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-19 15:13:42,160 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-19 15:13:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 372269661, now seen corresponding path program 1 times [2021-12-19 15:13:42,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521378742] [2021-12-19 15:13:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:42,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:42,307 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-19 15:13:42,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:42,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521378742] [2021-12-19 15:13:42,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521378742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:42,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230517352] [2021-12-19 15:13:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:42,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:42,312 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-19 15:13:42,340 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-19 15:13:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:42,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 15:13:42,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:42,512 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-19 15:13:42,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 15:13:42,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230517352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:42,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 15:13:42,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-19 15:13:42,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474066503] [2021-12-19 15:13:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:42,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:42,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-19 15:13:42,514 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-19 15:13:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:42,664 INFO L93 Difference]: Finished difference Result 316 states and 425 transitions. [2021-12-19 15:13:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:42,665 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-19 15:13:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:42,666 INFO L225 Difference]: With dead ends: 316 [2021-12-19 15:13:42,666 INFO L226 Difference]: Without dead ends: 206 [2021-12-19 15:13:42,666 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-19 15:13:42,667 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-19 15:13:42,667 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-19 15:13:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-19 15:13:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 170. [2021-12-19 15:13:42,674 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-19 15:13:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2021-12-19 15:13:42,675 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 39 [2021-12-19 15:13:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:42,676 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2021-12-19 15:13:42,676 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-19 15:13:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2021-12-19 15:13:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-19 15:13:42,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:42,681 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-19 15:13:42,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-19 15:13:42,894 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-19 15:13:42,895 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-19 15:13:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1104758513, now seen corresponding path program 1 times [2021-12-19 15:13:42,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:42,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337733903] [2021-12-19 15:13:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:42,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:43,055 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-19 15:13:43,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:43,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337733903] [2021-12-19 15:13:43,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337733903] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:43,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153253100] [2021-12-19 15:13:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:43,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:43,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:43,060 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-19 15:13:43,087 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-19 15:13:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:43,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 15:13:43,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:43,272 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-19 15:13:43,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 15:13:43,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153253100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:43,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 15:13:43,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-19 15:13:43,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373783438] [2021-12-19 15:13:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:43,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:43,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-19 15:13:43,274 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-19 15:13:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:43,440 INFO L93 Difference]: Finished difference Result 381 states and 496 transitions. [2021-12-19 15:13:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:43,441 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-19 15:13:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:43,442 INFO L225 Difference]: With dead ends: 381 [2021-12-19 15:13:43,442 INFO L226 Difference]: Without dead ends: 239 [2021-12-19 15:13:43,443 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-19 15:13:43,444 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.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:43,444 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.2s Time] [2021-12-19 15:13:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-19 15:13:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 202. [2021-12-19 15:13:43,452 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-19 15:13:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 244 transitions. [2021-12-19 15:13:43,453 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 244 transitions. Word has length 46 [2021-12-19 15:13:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:43,455 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 244 transitions. [2021-12-19 15:13:43,455 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-19 15:13:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 244 transitions. [2021-12-19 15:13:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-19 15:13:43,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:43,457 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-19 15:13:43,484 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-19 15:13:43,671 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-19 15:13:43,672 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-19 15:13:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2090870759, now seen corresponding path program 1 times [2021-12-19 15:13:43,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:43,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840760559] [2021-12-19 15:13:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:43,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:43,719 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-19 15:13:43,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:43,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840760559] [2021-12-19 15:13:43,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840760559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:43,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:43,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 15:13:43,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352994882] [2021-12-19 15:13:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:43,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 15:13:43,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:43,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 15:13:43,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 15:13:43,722 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-19 15:13:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:43,729 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2021-12-19 15:13:43,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 15:13:43,729 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-19 15:13:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:43,730 INFO L225 Difference]: With dead ends: 239 [2021-12-19 15:13:43,730 INFO L226 Difference]: Without dead ends: 178 [2021-12-19 15:13:43,731 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-19 15:13:43,731 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-19 15:13:43,732 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-19 15:13:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-19 15:13:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2021-12-19 15:13:43,735 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-19 15:13:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2021-12-19 15:13:43,736 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 53 [2021-12-19 15:13:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:43,737 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2021-12-19 15:13:43,737 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-19 15:13:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2021-12-19 15:13:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 15:13:43,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:43,738 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-19 15:13:43,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-19 15:13:43,738 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-19 15:13:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1462173614, now seen corresponding path program 1 times [2021-12-19 15:13:43,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:43,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139645241] [2021-12-19 15:13:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:43,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:43,787 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-19 15:13:43,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:43,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139645241] [2021-12-19 15:13:43,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139645241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:43,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:43,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 15:13:43,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96686750] [2021-12-19 15:13:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:43,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:43,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:43,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 15:13:43,790 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-19 15:13:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:43,834 INFO L93 Difference]: Finished difference Result 409 states and 500 transitions. [2021-12-19 15:13:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:43,835 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-19 15:13:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:43,837 INFO L225 Difference]: With dead ends: 409 [2021-12-19 15:13:43,837 INFO L226 Difference]: Without dead ends: 280 [2021-12-19 15:13:43,837 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-19 15:13:43,838 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-19 15:13:43,838 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-19 15:13:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-12-19 15:13:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 198. [2021-12-19 15:13:43,844 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-19 15:13:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2021-12-19 15:13:43,845 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 62 [2021-12-19 15:13:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:43,845 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2021-12-19 15:13:43,845 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-19 15:13:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2021-12-19 15:13:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 15:13:43,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:43,846 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-19 15:13:43,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-19 15:13:43,847 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-19 15:13:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 588810384, now seen corresponding path program 2 times [2021-12-19 15:13:43,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738106376] [2021-12-19 15:13:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:43,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:43,898 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-19 15:13:43,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:43,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738106376] [2021-12-19 15:13:43,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738106376] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:43,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377654703] [2021-12-19 15:13:43,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 15:13:43,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:43,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:43,901 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-19 15:13:43,909 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-19 15:13:43,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 15:13:43,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 15:13:43,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 15:13:43,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:44,109 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-19 15:13:44,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 15:13:44,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377654703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:44,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 15:13:44,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-19 15:13:44,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337685155] [2021-12-19 15:13:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:44,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 15:13:44,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:44,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 15:13:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-19 15:13:44,113 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-19 15:13:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:44,320 INFO L93 Difference]: Finished difference Result 861 states and 1118 transitions. [2021-12-19 15:13:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 15:13:44,320 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-19 15:13:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:44,323 INFO L225 Difference]: With dead ends: 861 [2021-12-19 15:13:44,323 INFO L226 Difference]: Without dead ends: 643 [2021-12-19 15:13:44,323 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-19 15:13:44,324 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 203 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 15:13:44,324 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-19 15:13:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-12-19 15:13:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 372. [2021-12-19 15:13:44,335 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-19 15:13:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 472 transitions. [2021-12-19 15:13:44,336 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 472 transitions. Word has length 62 [2021-12-19 15:13:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:44,337 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 472 transitions. [2021-12-19 15:13:44,337 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-19 15:13:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 472 transitions. [2021-12-19 15:13:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-19 15:13:44,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:44,349 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-19 15:13:44,356 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-19 15:13:44,554 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-19 15:13:44,554 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-19 15:13:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2012788217, now seen corresponding path program 1 times [2021-12-19 15:13:44,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038945661] [2021-12-19 15:13:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:44,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:44,609 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-19 15:13:44,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:44,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038945661] [2021-12-19 15:13:44,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038945661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:44,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126762220] [2021-12-19 15:13:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:44,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:44,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:44,613 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-19 15:13:44,620 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-19 15:13:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:44,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 15:13:44,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:44,821 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-19 15:13:44,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 15:13:45,055 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-19 15:13:45,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126762220] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 15:13:45,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 15:13:45,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 7 [2021-12-19 15:13:45,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917018086] [2021-12-19 15:13:45,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 15:13:45,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 15:13:45,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:45,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 15:13:45,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 15:13:45,061 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-19 15:13:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:45,223 INFO L93 Difference]: Finished difference Result 910 states and 1146 transitions. [2021-12-19 15:13:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 15:13:45,224 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-19 15:13:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:45,226 INFO L225 Difference]: With dead ends: 910 [2021-12-19 15:13:45,226 INFO L226 Difference]: Without dead ends: 573 [2021-12-19 15:13:45,227 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-19 15:13:45,227 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 244 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:45,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 151 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 15:13:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-12-19 15:13:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 378. [2021-12-19 15:13:45,237 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-19 15:13:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 478 transitions. [2021-12-19 15:13:45,238 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 478 transitions. Word has length 65 [2021-12-19 15:13:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:45,238 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 478 transitions. [2021-12-19 15:13:45,238 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-19 15:13:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 478 transitions. [2021-12-19 15:13:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-19 15:13:45,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:45,239 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-19 15:13:45,266 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-19 15:13:45,464 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-19 15:13:45,464 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-19 15:13:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1236002389, now seen corresponding path program 1 times [2021-12-19 15:13:45,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:45,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872506746] [2021-12-19 15:13:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:45,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:45,536 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-19 15:13:45,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872506746] [2021-12-19 15:13:45,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872506746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:45,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:45,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 15:13:45,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327786692] [2021-12-19 15:13:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:45,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 15:13:45,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:45,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 15:13:45,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 15:13:45,537 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-19 15:13:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:45,753 INFO L93 Difference]: Finished difference Result 1134 states and 1439 transitions. [2021-12-19 15:13:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 15:13:45,753 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-19 15:13:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:45,756 INFO L225 Difference]: With dead ends: 1134 [2021-12-19 15:13:45,756 INFO L226 Difference]: Without dead ends: 781 [2021-12-19 15:13:45,757 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-19 15:13:45,757 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 203 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:45,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 175 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 15:13:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-12-19 15:13:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 647. [2021-12-19 15:13:45,772 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-19 15:13:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 813 transitions. [2021-12-19 15:13:45,774 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 813 transitions. Word has length 71 [2021-12-19 15:13:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:45,774 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 813 transitions. [2021-12-19 15:13:45,774 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-19 15:13:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 813 transitions. [2021-12-19 15:13:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-19 15:13:45,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:45,776 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-19 15:13:45,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-19 15:13:45,776 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-19 15:13:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash 479236665, now seen corresponding path program 1 times [2021-12-19 15:13:45,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:45,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819056529] [2021-12-19 15:13:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:45,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:45,828 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-19 15:13:45,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819056529] [2021-12-19 15:13:45,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819056529] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597715257] [2021-12-19 15:13:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:45,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:45,830 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-19 15:13:45,831 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-19 15:13:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:45,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 15:13:45,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:46,043 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-19 15:13:46,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 15:13:46,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597715257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:46,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 15:13:46,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-19 15:13:46,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139458534] [2021-12-19 15:13:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:46,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 15:13:46,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:46,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 15:13:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 15:13:46,046 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-19 15:13:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:46,136 INFO L93 Difference]: Finished difference Result 1324 states and 1648 transitions. [2021-12-19 15:13:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 15:13:46,137 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-19 15:13:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:46,141 INFO L225 Difference]: With dead ends: 1324 [2021-12-19 15:13:46,141 INFO L226 Difference]: Without dead ends: 960 [2021-12-19 15:13:46,143 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-19 15:13:46,144 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-19 15:13:46,145 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-19 15:13:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-19 15:13:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 787. [2021-12-19 15:13:46,162 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-19 15:13:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 989 transitions. [2021-12-19 15:13:46,164 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 989 transitions. Word has length 71 [2021-12-19 15:13:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:46,164 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 989 transitions. [2021-12-19 15:13:46,165 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-19 15:13:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 989 transitions. [2021-12-19 15:13:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-19 15:13:46,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:46,169 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-19 15:13:46,196 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-19 15:13:46,382 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-19 15:13:46,383 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-19 15:13:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 796532883, now seen corresponding path program 1 times [2021-12-19 15:13:46,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:46,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061585] [2021-12-19 15:13:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:46,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:46,467 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-19 15:13:46,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:46,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061585] [2021-12-19 15:13:46,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061585] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:46,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:46,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 15:13:46,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100008236] [2021-12-19 15:13:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:46,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 15:13:46,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 15:13:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-19 15:13:46,469 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-19 15:13:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:46,793 INFO L93 Difference]: Finished difference Result 2041 states and 2554 transitions. [2021-12-19 15:13:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 15:13:46,793 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-19 15:13:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:46,798 INFO L225 Difference]: With dead ends: 2041 [2021-12-19 15:13:46,798 INFO L226 Difference]: Without dead ends: 1223 [2021-12-19 15:13:46,799 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-19 15:13:46,800 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 174 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:46,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 276 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 15:13:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2021-12-19 15:13:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1051. [2021-12-19 15:13:46,830 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-19 15:13:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1322 transitions. [2021-12-19 15:13:46,833 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1322 transitions. Word has length 77 [2021-12-19 15:13:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:46,834 INFO L470 AbstractCegarLoop]: Abstraction has 1051 states and 1322 transitions. [2021-12-19 15:13:46,834 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-19 15:13:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1322 transitions. [2021-12-19 15:13:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-19 15:13:46,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:46,835 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-19 15:13:46,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-19 15:13:46,836 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-19 15:13:46,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 302771165, now seen corresponding path program 1 times [2021-12-19 15:13:46,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:46,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504353769] [2021-12-19 15:13:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:46,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:46,874 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-19 15:13:46,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504353769] [2021-12-19 15:13:46,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504353769] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74550670] [2021-12-19 15:13:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:46,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:46,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:46,876 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-19 15:13:46,904 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-19 15:13:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:46,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 15:13:46,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:47,111 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-19 15:13:47,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 15:13:47,227 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-19 15:13:47,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74550670] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 15:13:47,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 15:13:47,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2021-12-19 15:13:47,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766499591] [2021-12-19 15:13:47,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 15:13:47,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-19 15:13:47,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:47,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 15:13:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-19 15:13:47,230 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-19 15:13:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:48,486 INFO L93 Difference]: Finished difference Result 5477 states and 6500 transitions. [2021-12-19 15:13:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-19 15:13:48,486 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-19 15:13:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:48,502 INFO L225 Difference]: With dead ends: 5477 [2021-12-19 15:13:48,502 INFO L226 Difference]: Without dead ends: 5404 [2021-12-19 15:13:48,503 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-19 15:13:48,504 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 656 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:48,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 774 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-19 15:13:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2021-12-19 15:13:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 1470. [2021-12-19 15:13:48,565 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-19 15:13:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1952 transitions. [2021-12-19 15:13:48,571 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1952 transitions. Word has length 77 [2021-12-19 15:13:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:48,571 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 1952 transitions. [2021-12-19 15:13:48,571 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-19 15:13:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1952 transitions. [2021-12-19 15:13:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-19 15:13:48,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:48,574 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-19 15:13:48,599 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-19 15:13:48,797 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-19 15:13:48,797 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-19 15:13:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-12-19 15:13:48,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:48,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871412677] [2021-12-19 15:13:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:48,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:48,881 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-19 15:13:48,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:48,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871412677] [2021-12-19 15:13:48,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871412677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:48,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:48,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 15:13:48,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574532617] [2021-12-19 15:13:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:48,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 15:13:48,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 15:13:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 15:13:48,883 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-19 15:13:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:48,992 INFO L93 Difference]: Finished difference Result 3683 states and 4688 transitions. [2021-12-19 15:13:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 15:13:48,992 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-19 15:13:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:48,999 INFO L225 Difference]: With dead ends: 3683 [2021-12-19 15:13:48,999 INFO L226 Difference]: Without dead ends: 2250 [2021-12-19 15:13:49,001 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-19 15:13:49,002 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 204 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:49,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 261 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 15:13:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2021-12-19 15:13:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1698. [2021-12-19 15:13:49,051 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-19 15:13:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2085 transitions. [2021-12-19 15:13:49,055 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2085 transitions. Word has length 83 [2021-12-19 15:13:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:49,055 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 2085 transitions. [2021-12-19 15:13:49,055 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-19 15:13:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2085 transitions. [2021-12-19 15:13:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-19 15:13:49,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:49,057 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-19 15:13:49,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-19 15:13:49,058 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-19 15:13:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash -45908259, now seen corresponding path program 1 times [2021-12-19 15:13:49,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:49,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363015507] [2021-12-19 15:13:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:49,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:49,166 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-19 15:13:49,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363015507] [2021-12-19 15:13:49,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363015507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:49,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:49,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 15:13:49,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808886759] [2021-12-19 15:13:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:49,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 15:13:49,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 15:13:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 15:13:49,168 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-19 15:13:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:49,525 INFO L93 Difference]: Finished difference Result 3581 states and 4374 transitions. [2021-12-19 15:13:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 15:13:49,526 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-19 15:13:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:49,536 INFO L225 Difference]: With dead ends: 3581 [2021-12-19 15:13:49,536 INFO L226 Difference]: Without dead ends: 3466 [2021-12-19 15:13:49,537 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-19 15:13:49,538 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.3s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:49,538 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.3s Time] [2021-12-19 15:13:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2021-12-19 15:13:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 1703. [2021-12-19 15:13:49,594 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-19 15:13:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2090 transitions. [2021-12-19 15:13:49,598 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2090 transitions. Word has length 83 [2021-12-19 15:13:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:49,599 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 2090 transitions. [2021-12-19 15:13:49,599 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-19 15:13:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2090 transitions. [2021-12-19 15:13:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-19 15:13:49,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:49,601 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-19 15:13:49,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-19 15:13:49,602 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-19 15:13:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash -923892381, now seen corresponding path program 1 times [2021-12-19 15:13:49,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:49,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950612203] [2021-12-19 15:13:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:49,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:49,654 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-19 15:13:49,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:49,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950612203] [2021-12-19 15:13:49,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950612203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:49,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:49,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 15:13:49,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545788268] [2021-12-19 15:13:49,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:49,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 15:13:49,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:49,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 15:13:49,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 15:13:49,657 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-19 15:13:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:49,880 INFO L93 Difference]: Finished difference Result 3118 states and 3817 transitions. [2021-12-19 15:13:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 15:13:49,881 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-19 15:13:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:49,887 INFO L225 Difference]: With dead ends: 3118 [2021-12-19 15:13:49,887 INFO L226 Difference]: Without dead ends: 2105 [2021-12-19 15:13:49,889 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-19 15:13:49,890 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 231 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:49,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 164 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 15:13:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2021-12-19 15:13:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1889. [2021-12-19 15:13:49,946 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-19 15:13:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2306 transitions. [2021-12-19 15:13:49,952 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2306 transitions. Word has length 83 [2021-12-19 15:13:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:49,952 INFO L470 AbstractCegarLoop]: Abstraction has 1889 states and 2306 transitions. [2021-12-19 15:13:49,952 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-19 15:13:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2306 transitions. [2021-12-19 15:13:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-19 15:13:49,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:49,955 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-19 15:13:49,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-19 15:13:49,955 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-19 15:13:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1662068397, now seen corresponding path program 1 times [2021-12-19 15:13:49,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944293083] [2021-12-19 15:13:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:49,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:50,028 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-19 15:13:50,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:50,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944293083] [2021-12-19 15:13:50,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944293083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:50,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:50,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 15:13:50,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970760436] [2021-12-19 15:13:50,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:50,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 15:13:50,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 15:13:50,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-19 15:13:50,030 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-19 15:13:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:50,362 INFO L93 Difference]: Finished difference Result 3473 states and 4225 transitions. [2021-12-19 15:13:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 15:13:50,363 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-19 15:13:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:50,370 INFO L225 Difference]: With dead ends: 3473 [2021-12-19 15:13:50,370 INFO L226 Difference]: Without dead ends: 2269 [2021-12-19 15:13:50,372 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-19 15:13:50,373 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 250 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:50,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 231 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 15:13:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2021-12-19 15:13:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1665. [2021-12-19 15:13:50,417 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-19 15:13:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2046 transitions. [2021-12-19 15:13:50,421 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2046 transitions. Word has length 83 [2021-12-19 15:13:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:50,421 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2046 transitions. [2021-12-19 15:13:50,421 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-19 15:13:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2046 transitions. [2021-12-19 15:13:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-19 15:13:50,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:50,424 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-19 15:13:50,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-19 15:13:50,424 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-19 15:13:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash 335021134, now seen corresponding path program 1 times [2021-12-19 15:13:50,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412156348] [2021-12-19 15:13:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:50,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:50,510 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-19 15:13:50,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412156348] [2021-12-19 15:13:50,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412156348] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760314299] [2021-12-19 15:13:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:50,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:50,512 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-19 15:13:50,540 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-19 15:13:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:50,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 15:13:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:13:50,789 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-19 15:13:50,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 15:13:51,067 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-19 15:13:51,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760314299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 15:13:51,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 15:13:51,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-19 15:13:51,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626341285] [2021-12-19 15:13:51,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 15:13:51,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-19 15:13:51,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:51,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-19 15:13:51,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-19 15:13:51,069 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-19 15:13:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:51,219 INFO L93 Difference]: Finished difference Result 2948 states and 3640 transitions. [2021-12-19 15:13:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 15:13:51,220 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-19 15:13:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:51,224 INFO L225 Difference]: With dead ends: 2948 [2021-12-19 15:13:51,225 INFO L226 Difference]: Without dead ends: 1286 [2021-12-19 15:13:51,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2021-12-19 15:13:51,232 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 318 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:51,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 133 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 15:13:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-12-19 15:13:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1158. [2021-12-19 15:13:51,272 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-19 15:13:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1430 transitions. [2021-12-19 15:13:51,275 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1430 transitions. Word has length 83 [2021-12-19 15:13:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:51,275 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 1430 transitions. [2021-12-19 15:13:51,275 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-19 15:13:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1430 transitions. [2021-12-19 15:13:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-19 15:13:51,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:51,276 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-19 15:13:51,303 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-19 15:13:51,493 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-19 15:13:51,493 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-19 15:13:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash 6193209, now seen corresponding path program 1 times [2021-12-19 15:13:51,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:51,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285561166] [2021-12-19 15:13:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:51,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:51,588 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-19 15:13:51,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285561166] [2021-12-19 15:13:51,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285561166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 15:13:51,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 15:13:51,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 15:13:51,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378222603] [2021-12-19 15:13:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 15:13:51,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 15:13:51,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:13:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 15:13:51,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-19 15:13:51,591 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-19 15:13:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:13:52,051 INFO L93 Difference]: Finished difference Result 2520 states and 3083 transitions. [2021-12-19 15:13:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 15:13:52,052 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-19 15:13:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:13:52,059 INFO L225 Difference]: With dead ends: 2520 [2021-12-19 15:13:52,059 INFO L226 Difference]: Without dead ends: 2405 [2021-12-19 15:13:52,060 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-19 15:13:52,061 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.4s IncrementalHoareTripleChecker+Time [2021-12-19 15:13:52,061 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.4s Time] [2021-12-19 15:13:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2021-12-19 15:13:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1151. [2021-12-19 15:13:52,097 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-19 15:13:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1422 transitions. [2021-12-19 15:13:52,100 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1422 transitions. Word has length 85 [2021-12-19 15:13:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:13:52,100 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1422 transitions. [2021-12-19 15:13:52,100 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-19 15:13:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1422 transitions. [2021-12-19 15:13:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-19 15:13:52,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:13:52,102 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-19 15:13:52,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-19 15:13:52,102 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-19 15:13:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:13:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2021-12-19 15:13:52,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:13:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181767296] [2021-12-19 15:13:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:52,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:13:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:52,216 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-19 15:13:52,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:13:52,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181767296] [2021-12-19 15:13:52,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181767296] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:13:52,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393074792] [2021-12-19 15:13:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:13:52,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:13:52,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:13:52,218 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-19 15:13:52,247 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-19 15:13:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:13:52,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-19 15:13:52,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:15:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-19 15:15:01,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 15:15:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-19 15:15:01,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393074792] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 15:15:01,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 15:15:01,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 15 [2021-12-19 15:15:01,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368038412] [2021-12-19 15:15:01,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 15:15:01,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-19 15:15:01,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:15:01,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 15:15:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-19 15:15:01,395 INFO L87 Difference]: Start difference. First operand 1151 states and 1422 transitions. Second operand has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 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-19 15:15:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:15:02,639 INFO L93 Difference]: Finished difference Result 2904 states and 3600 transitions. [2021-12-19 15:15:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-19 15:15:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 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-19 15:15:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:15:02,644 INFO L225 Difference]: With dead ends: 2904 [2021-12-19 15:15:02,644 INFO L226 Difference]: Without dead ends: 1766 [2021-12-19 15:15:02,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1446, Unknown=0, NotChecked=0, Total=1806 [2021-12-19 15:15:02,647 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 849 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-19 15:15:02,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 731 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 822 Invalid, 0 Unknown, 197 Unchecked, 0.7s Time] [2021-12-19 15:15:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2021-12-19 15:15:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1435. [2021-12-19 15:15:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.189679218967922) internal successors, (1706), 1434 states have internal predecessors, (1706), 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-19 15:15:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1706 transitions. [2021-12-19 15:15:02,683 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1706 transitions. Word has length 89 [2021-12-19 15:15:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:15:02,684 INFO L470 AbstractCegarLoop]: Abstraction has 1435 states and 1706 transitions. [2021-12-19 15:15:02,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 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-19 15:15:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1706 transitions. [2021-12-19 15:15:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-19 15:15:02,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:15:02,686 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-19 15:15:02,712 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-19 15:15:02,909 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-19 15:15:02,910 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-19 15:15:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:15:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1585272271, now seen corresponding path program 1 times [2021-12-19 15:15:02,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:15:02,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275332987] [2021-12-19 15:15:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:15:02,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:15:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:15:03,072 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-19 15:15:03,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:15:03,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275332987] [2021-12-19 15:15:03,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275332987] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:15:03,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052860560] [2021-12-19 15:15:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:15:03,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:15:03,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:15:03,074 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-19 15:15:03,076 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-19 15:15:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:15:03,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 15:15:03,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:15:03,547 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-19 15:15:03,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 15:15:03,760 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-19 15:15:03,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052860560] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 15:15:03,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 15:15:03,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-19 15:15:03,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401063569] [2021-12-19 15:15:03,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 15:15:03,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 15:15:03,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:15:03,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 15:15:03,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-19 15:15:03,762 INFO L87 Difference]: Start difference. First operand 1435 states and 1706 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-19 15:15:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:15:04,074 INFO L93 Difference]: Finished difference Result 2919 states and 3447 transitions. [2021-12-19 15:15:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 15:15:04,075 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-19 15:15:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:15:04,079 INFO L225 Difference]: With dead ends: 2919 [2021-12-19 15:15:04,080 INFO L226 Difference]: Without dead ends: 1732 [2021-12-19 15:15:04,084 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-19 15:15:04,084 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 501 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 15:15:04,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 749 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 15:15:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2021-12-19 15:15:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1185. [2021-12-19 15:15:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.197635135135135) internal successors, (1418), 1184 states have internal predecessors, (1418), 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-19 15:15:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1418 transitions. [2021-12-19 15:15:04,137 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1418 transitions. Word has length 91 [2021-12-19 15:15:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:15:04,138 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 1418 transitions. [2021-12-19 15:15:04,141 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-19 15:15:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1418 transitions. [2021-12-19 15:15:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-19 15:15:04,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:15:04,143 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-19 15:15:04,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-19 15:15:04,348 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-19 15:15:04,348 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-19 15:15:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:15:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 365632685, now seen corresponding path program 2 times [2021-12-19 15:15:04,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:15:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11535271] [2021-12-19 15:15:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:15:04,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:15:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 15:15:04,452 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-19 15:15:04,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 15:15:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11535271] [2021-12-19 15:15:04,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11535271] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 15:15:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959592962] [2021-12-19 15:15:04,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 15:15:04,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 15:15:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 15:15:04,454 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-19 15:15:04,455 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-19 15:15:04,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 15:15:04,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 15:15:04,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 15:15:04,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 15:15:05,066 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-19 15:15:05,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 15:15:05,381 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-19 15:15:05,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959592962] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 15:15:05,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 15:15:05,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-12-19 15:15:05,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149444937] [2021-12-19 15:15:05,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 15:15:05,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-19 15:15:05,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 15:15:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 15:15:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-19 15:15:05,383 INFO L87 Difference]: Start difference. First operand 1185 states and 1418 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-19 15:15:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 15:15:06,526 INFO L93 Difference]: Finished difference Result 4620 states and 5317 transitions. [2021-12-19 15:15:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-19 15:15:06,527 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-19 15:15:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 15:15:06,536 INFO L225 Difference]: With dead ends: 4620 [2021-12-19 15:15:06,536 INFO L226 Difference]: Without dead ends: 3630 [2021-12-19 15:15:06,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-12-19 15:15:06,539 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 937 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-19 15:15:06,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [937 Valid, 1565 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-19 15:15:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2021-12-19 15:15:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 584. [2021-12-19 15:15:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 1.1886792452830188) internal successors, (693), 583 states have internal predecessors, (693), 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-19 15:15:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 693 transitions. [2021-12-19 15:15:06,571 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 693 transitions. Word has length 91 [2021-12-19 15:15:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 15:15:06,571 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 693 transitions. [2021-12-19 15:15:06,571 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-19 15:15:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 693 transitions. [2021-12-19 15:15:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-19 15:15:06,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 15:15:06,573 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-19 15:15:06,600 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-19 15:15:06,787 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-19 15:15:06,787 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-19 15:15:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 15:15:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-12-19 15:15:06,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 15:15:06,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149479383] [2021-12-19 15:15:06,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 15:15:06,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 15:15:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 15:15:06,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 15:15:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 15:15:06,894 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 15:15:06,894 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-19 15:15:06,895 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-19 15:15:06,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-19 15:15:06,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-19 15:15:06,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-19 15:15:06,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-19 15:15:06,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-19 15:15:06,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-19 15:15:06,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-19 15:15:06,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-19 15:15:06,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-19 15:15:06,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-19 15:15:06,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-19 15:15:06,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-19 15:15:06,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-19 15:15:06,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-19 15:15:06,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-19 15:15:06,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-19 15:15:06,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-19 15:15:06,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-19 15:15:06,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-19 15:15:06,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-19 15:15:06,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-19 15:15:06,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-19 15:15:06,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-19 15:15:06,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-19 15:15:06,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-19 15:15:06,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-19 15:15:06,907 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-19 15:15:06,910 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-19 15:15:07,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:15:07 BoogieIcfgContainer [2021-12-19 15:15:07,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-19 15:15:07,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 15:15:07,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 15:15:07,022 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 15:15:07,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:13:39" (3/4) ... [2021-12-19 15:15:07,025 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-19 15:15:07,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 15:15:07,026 INFO L158 Benchmark]: Toolchain (without parser) took 87741.75ms. Allocated memory was 86.0MB in the beginning and 572.5MB in the end (delta: 486.5MB). Free memory was 47.2MB in the beginning and 221.6MB in the end (delta: -174.3MB). Peak memory consumption was 311.2MB. Max. memory is 16.1GB. [2021-12-19 15:15:07,026 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 15:15:07,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.61ms. Allocated memory is still 86.0MB. Free memory was 47.0MB in the beginning and 60.1MB in the end (delta: -13.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2021-12-19 15:15:07,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.63ms. Allocated memory is still 86.0MB. Free memory was 60.1MB in the beginning and 58.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 15:15:07,027 INFO L158 Benchmark]: Boogie Preprocessor took 26.71ms. Allocated memory is still 86.0MB. Free memory was 58.0MB in the beginning and 56.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 15:15:07,028 INFO L158 Benchmark]: RCFGBuilder took 369.95ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 61.3MB in the end (delta: -4.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-19 15:15:07,030 INFO L158 Benchmark]: TraceAbstraction took 87044.80ms. Allocated memory was 113.2MB in the beginning and 572.5MB in the end (delta: 459.3MB). Free memory was 90.8MB in the beginning and 222.6MB in the end (delta: -131.8MB). Peak memory consumption was 326.9MB. Max. memory is 16.1GB. [2021-12-19 15:15:07,030 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 572.5MB. Free memory was 222.6MB in the beginning and 221.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 15:15:07,037 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.21ms. Allocated memory is still 86.0MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.61ms. Allocated memory is still 86.0MB. Free memory was 47.0MB in the beginning and 60.1MB in the end (delta: -13.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.63ms. Allocated memory is still 86.0MB. Free memory was 60.1MB in the beginning and 58.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.71ms. Allocated memory is still 86.0MB. Free memory was 58.0MB in the beginning and 56.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.95ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 61.3MB in the end (delta: -4.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 87044.80ms. Allocated memory was 113.2MB in the beginning and 572.5MB in the end (delta: 459.3MB). Free memory was 90.8MB in the beginning and 222.6MB in the end (delta: -131.8MB). Peak memory consumption was 326.9MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 572.5MB. Free memory was 222.6MB in the beginning and 221.6MB in the end (delta: 1.0MB). 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, 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)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=1929379840] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=1929379840] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=1929379840] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=1929379840] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=1929379840] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1929379840] [L83] COND TRUE i < na VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1929379840] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1929379840] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=1929379840] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1929379840] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1929379840] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1929379840] [L89] COND TRUE i < nb VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1929379840] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1929379840] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=1929379840] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=1929379840] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=1929379840] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=1929379840] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=1929379840] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=1929379840] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L83] COND TRUE i < na VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1929379840, r1=1929379841] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1929379840, r1=1929379841] [L89] COND TRUE i < nb VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1929379840, r1=1929379841] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1929379840, r1=1929379841] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1929379840, r1=1929379841] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=1929379840, r1=1929379841] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=1929379840, r1=1929379841] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=1929379840, r1=1929379841] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=1929379840, r1=1929379841] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=1929379840, r1=1929379841] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=1929379840, r1=1929379841] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=1929379840, r1=1929379841, r2=1929379842] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=1929379840, r1=1929379841, r2=1929379842] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=2, r0=1929379840, r1=1929379841, r2=1929379842] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841, r2=1929379842] [L83] COND TRUE i < na VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841, r2=1929379842] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841, r2=1929379842] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841, r2=1929379842] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841, r2=1929379842] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=1929379840, r1=1929379841, r2=1929379842] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=1929379840, r1=1929379841, r2=1929379842] [L89] COND TRUE i < nb VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=1929379840, r1=1929379841, r2=1929379842] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=1929379840, r1=1929379841, r2=1929379842] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=1929379840, r1=1929379841, r2=1929379842] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=1929379840, r1=1929379841, r2=1929379842] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=1929379840, r1=1929379841, r2=1929379842] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] [L116] r1 << 8U VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] [L116] r2 << 16U VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] [L116] r3 << 24U VAL [\old(a)=1929379839, \old(b)=234770789, a=1929379839, a0=1929379839, a1=7536639, a2=29439, a3=114, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=1929379840, r1=1929379841, r2=1929379842, r3=128] - 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: 86.9s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6202 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6202 mSDsluCounter, 9290 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 197 IncrementalHoareTripleChecker+Unchecked, 6573 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5907 IncrementalHoareTripleChecker+Invalid, 6752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 2717 mSDtfsCounter, 5907 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1565 GetRequests, 1295 SyntacticMatches, 16 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1889occurred in iteration=20, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 13648 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 73.8s InterpolantComputationTime, 2391 NumberOfCodeBlocks, 2391 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2743 ConstructedInterpolants, 28 QuantifiedInterpolants, 12292 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1766 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 2086/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-19 15:15:07,084 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