./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec 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_1-2.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 ae0b445eba18f91587d7dc0f5adde2c3f4731247 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 11:25:26,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 11:25:26,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 11:25:26,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 11:25:26,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 11:25:26,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 11:25:26,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 11:25:26,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 11:25:26,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 11:25:26,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 11:25:26,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 11:25:26,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 11:25:26,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 11:25:26,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 11:25:26,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 11:25:26,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 11:25:26,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 11:25:26,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 11:25:26,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 11:25:26,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 11:25:26,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 11:25:26,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 11:25:26,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 11:25:26,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 11:25:26,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 11:25:26,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 11:25:26,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 11:25:26,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 11:25:26,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 11:25:26,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 11:25:26,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 11:25:26,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 11:25:26,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 11:25:26,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 11:25:26,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 11:25:26,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 11:25:26,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 11:25:26,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 11:25:26,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 11:25:26,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 11:25:26,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 11:25:26,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-08-27 11:25:26,676 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 11:25:26,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 11:25:26,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 11:25:26,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 11:25:26,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 11:25:26,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 11:25:26,679 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 11:25:26,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 11:25:26,680 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 11:25:26,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 11:25:26,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 11:25:26,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 11:25:26,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 11:25:26,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 11:25:26,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 11:25:26,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 11:25:26,682 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 11:25:26,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 11:25:26,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 11:25:26,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 11:25:26,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 11:25:26,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 11:25:26,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 11:25:26,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 11:25:26,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:25:26,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 11:25:26,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 11:25:26,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 11:25:26,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 11:25:26,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 11:25:26,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 11:25:26,684 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 11:25:26,684 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 -> ae0b445eba18f91587d7dc0f5adde2c3f4731247 [2021-08-27 11:25:26,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 11:25:26,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 11:25:26,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 11:25:26,963 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 11:25:26,977 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 11:25:26,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-08-27 11:25:27,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4faf272fd/3cb4cf3bddb6481dbc4c785c562a1dbb/FLAG06c2002c8 [2021-08-27 11:25:27,371 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 11:25:27,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-08-27 11:25:27,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4faf272fd/3cb4cf3bddb6481dbc4c785c562a1dbb/FLAG06c2002c8 [2021-08-27 11:25:27,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4faf272fd/3cb4cf3bddb6481dbc4c785c562a1dbb [2021-08-27 11:25:27,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 11:25:27,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 11:25:27,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 11:25:27,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 11:25:27,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 11:25:27,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d2b928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27, skipping insertion in model container [2021-08-27 11:25:27,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 11:25:27,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 11:25:27,991 WARN L228 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_1-2.i[863,876] [2021-08-27 11:25:28,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:25:28,015 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 11:25:28,056 WARN L228 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_1-2.i[863,876] [2021-08-27 11:25:28,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:25:28,078 INFO L208 MainTranslator]: Completed translation [2021-08-27 11:25:28,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28 WrapperNode [2021-08-27 11:25:28,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 11:25:28,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 11:25:28,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 11:25:28,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 11:25:28,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 11:25:28,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 11:25:28,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 11:25:28,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 11:25:28,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 11:25:28,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 11:25:28,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 11:25:28,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 11:25:28,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (1/1) ... [2021-08-27 11:25:28,127 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:25:28,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:28,139 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-08-27 11:25:28,156 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-08-27 11:25:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 11:25:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 11:25:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 11:25:28,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 11:25:28,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 11:25:28,641 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-27 11:25:28,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:28 BoogieIcfgContainer [2021-08-27 11:25:28,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 11:25:28,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 11:25:28,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 11:25:28,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 11:25:28,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:25:27" (1/3) ... [2021-08-27 11:25:28,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f90302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:25:28, skipping insertion in model container [2021-08-27 11:25:28,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:28" (2/3) ... [2021-08-27 11:25:28,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f90302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:25:28, skipping insertion in model container [2021-08-27 11:25:28,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:28" (3/3) ... [2021-08-27 11:25:28,663 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2021-08-27 11:25:28,667 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 11:25:28,667 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-08-27 11:25:28,712 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 11:25:28,727 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, mConcurrency=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-08-27 11:25:28,728 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-08-27 11:25:28,749 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-08-27 11:25:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-27 11:25:28,752 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:28,753 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-27 11:25:28,753 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-08-27 11:25:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-08-27 11:25:28,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:28,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453308823] [2021-08-27 11:25:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:28,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:28,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:28,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453308823] [2021-08-27 11:25:28,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453308823] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:28,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:28,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-27 11:25:28,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252794358] [2021-08-27 11:25:28,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 11:25:28,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 11:25:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:25:28,885 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-08-27 11:25:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:28,897 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-08-27 11:25:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 11:25:28,898 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-08-27 11:25:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:28,903 INFO L225 Difference]: With dead ends: 135 [2021-08-27 11:25:28,903 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 11:25:28,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:25:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 11:25:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 11:25:28,923 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-08-27 11:25:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-08-27 11:25:28,925 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-08-27 11:25:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:28,925 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-08-27 11:25:28,925 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-08-27 11:25:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-08-27 11:25:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:25:28,926 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:28,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:28,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 11:25:28,927 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-08-27 11:25:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-08-27 11:25:28,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:28,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478876873] [2021-08-27 11:25:28,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:28,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:29,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478876873] [2021-08-27 11:25:29,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478876873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:29,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:29,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973955874] [2021-08-27 11:25:29,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:29,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:29,012 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-08-27 11:25:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,153 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-08-27 11:25:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:29,153 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-08-27 11:25:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,154 INFO L225 Difference]: With dead ends: 145 [2021-08-27 11:25:29,155 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 11:25:29,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 11:25:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-08-27 11:25:29,160 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-08-27 11:25:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-08-27 11:25:29,161 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-08-27 11:25:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,161 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-08-27 11:25:29,161 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-08-27 11:25:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-08-27 11:25:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 11:25:29,162 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:29,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 11:25:29,163 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-08-27 11:25:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-08-27 11:25:29,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583906415] [2021-08-27 11:25:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:29,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583906415] [2021-08-27 11:25:29,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583906415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:29,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:29,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436837239] [2021-08-27 11:25:29,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:29,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:29,255 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-08-27 11:25:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,461 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-08-27 11:25:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:29,461 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-08-27 11:25:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,462 INFO L225 Difference]: With dead ends: 221 [2021-08-27 11:25:29,463 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 11:25:29,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 11:25:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-08-27 11:25:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-08-27 11:25:29,469 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-08-27 11:25:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,469 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-08-27 11:25:29,469 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-08-27 11:25:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-08-27 11:25:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:25:29,470 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,470 INFO L512 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-08-27 11:25:29,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 11:25:29,470 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-08-27 11:25:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-08-27 11:25:29,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589636624] [2021-08-27 11:25:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:29,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589636624] [2021-08-27 11:25:29,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589636624] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:29,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:29,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057516404] [2021-08-27 11:25:29,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:29,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:29,567 INFO L87 Difference]: Start difference. First operand 104 states and 135 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-08-27 11:25:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,753 INFO L93 Difference]: Finished difference Result 259 states and 340 transitions. [2021-08-27 11:25:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:29,754 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-08-27 11:25:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,755 INFO L225 Difference]: With dead ends: 259 [2021-08-27 11:25:29,755 INFO L226 Difference]: Without dead ends: 194 [2021-08-27 11:25:29,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-27 11:25:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2021-08-27 11:25:29,764 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-08-27 11:25:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2021-08-27 11:25:29,765 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2021-08-27 11:25:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,765 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2021-08-27 11:25:29,766 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-08-27 11:25:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2021-08-27 11:25:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 11:25:29,766 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,767 INFO L512 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-08-27 11:25:29,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 11:25:29,767 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-08-27 11:25:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2021-08-27 11:25:29,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759874709] [2021-08-27 11:25:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:29,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759874709] [2021-08-27 11:25:29,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759874709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:29,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:29,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550375196] [2021-08-27 11:25:29,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:29,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:29,815 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-08-27 11:25:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,819 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2021-08-27 11:25:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:29,819 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-08-27 11:25:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,820 INFO L225 Difference]: With dead ends: 192 [2021-08-27 11:25:29,820 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 11:25:29,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 11:25:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-08-27 11:25:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 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-08-27 11:25:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2021-08-27 11:25:29,824 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 26 [2021-08-27 11:25:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,824 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2021-08-27 11:25:29,824 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-08-27 11:25:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2021-08-27 11:25:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 11:25:29,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,825 INFO L512 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-08-27 11:25:29,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 11:25:29,825 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-08-27 11:25:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1291653624, now seen corresponding path program 1 times [2021-08-27 11:25:29,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884866578] [2021-08-27 11:25:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:29,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884866578] [2021-08-27 11:25:29,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884866578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:29,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:29,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838365724] [2021-08-27 11:25:29,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:29,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:29,869 INFO L87 Difference]: Start difference. First operand 91 states and 116 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-08-27 11:25:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,878 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2021-08-27 11:25:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:29,879 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-08-27 11:25:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,880 INFO L225 Difference]: With dead ends: 115 [2021-08-27 11:25:29,880 INFO L226 Difference]: Without dead ends: 102 [2021-08-27 11:25:29,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-27 11:25:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-08-27 11:25:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 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-08-27 11:25:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2021-08-27 11:25:29,883 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 32 [2021-08-27 11:25:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,883 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-08-27 11:25:29,884 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-08-27 11:25:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2021-08-27 11:25:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 11:25:29,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,886 INFO L512 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-08-27 11:25:29,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 11:25:29,886 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-08-27 11:25:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash 280536374, now seen corresponding path program 1 times [2021-08-27 11:25:29,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698920391] [2021-08-27 11:25:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:29,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698920391] [2021-08-27 11:25:29,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698920391] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:29,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729333459] [2021-08-27 11:25:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,941 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:29,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:29,960 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-08-27 11:25:29,965 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-08-27 11:25:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:30,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:30,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:30,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729333459] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:30,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:30,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-27 11:25:30,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174635525] [2021-08-27 11:25:30,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:30,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:30,285 INFO L87 Difference]: Start difference. First operand 102 states and 131 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-08-27 11:25:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:30,436 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2021-08-27 11:25:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:30,436 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-08-27 11:25:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:30,437 INFO L225 Difference]: With dead ends: 218 [2021-08-27 11:25:30,437 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 11:25:30,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 11:25:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2021-08-27 11:25:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.25) internal successors, (170), 136 states have internal predecessors, (170), 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-08-27 11:25:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-08-27 11:25:30,441 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 32 [2021-08-27 11:25:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:30,441 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-08-27 11:25:30,441 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-08-27 11:25:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-08-27 11:25:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 11:25:30,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:30,442 INFO L512 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-08-27 11:25:30,465 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-08-27 11:25:30,662 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-08-27 11:25:30,662 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-08-27 11:25:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1198830924, now seen corresponding path program 1 times [2021-08-27 11:25:30,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:30,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449666729] [2021-08-27 11:25:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:30,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:30,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:30,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449666729] [2021-08-27 11:25:30,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449666729] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:30,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608296077] [2021-08-27 11:25:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:30,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:30,793 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-08-27 11:25:30,861 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-08-27 11:25:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:30,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 11:25:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:31,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608296077] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:31,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:31,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-08-27 11:25:31,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635429010] [2021-08-27 11:25:31,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:31,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:31,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:31,233 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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-08-27 11:25:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:31,320 INFO L93 Difference]: Finished difference Result 258 states and 333 transitions. [2021-08-27 11:25:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:31,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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-08-27 11:25:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:31,322 INFO L225 Difference]: With dead ends: 258 [2021-08-27 11:25:31,322 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 11:25:31,322 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:25:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 11:25:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2021-08-27 11:25:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 123 states have internal predecessors, (152), 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-08-27 11:25:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2021-08-27 11:25:31,326 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 39 [2021-08-27 11:25:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:31,326 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2021-08-27 11:25:31,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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-08-27 11:25:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2021-08-27 11:25:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 11:25:31,327 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:31,327 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:31,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:31,548 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-08-27 11:25:31,549 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-08-27 11:25:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1326080275, now seen corresponding path program 1 times [2021-08-27 11:25:31,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:31,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57026416] [2021-08-27 11:25:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:31,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:31,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:31,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57026416] [2021-08-27 11:25:31,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57026416] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:31,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608336334] [2021-08-27 11:25:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:31,605 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:31,620 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-08-27 11:25:31,621 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-08-27 11:25:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:31,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 11:25:31,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 11:25:32,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608336334] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:32,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-08-27 11:25:32,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024057111] [2021-08-27 11:25:32,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:32,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:32,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:32,021 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08-27 11:25:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:32,184 INFO L93 Difference]: Finished difference Result 286 states and 377 transitions. [2021-08-27 11:25:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:32,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 48 [2021-08-27 11:25:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:32,185 INFO L225 Difference]: With dead ends: 286 [2021-08-27 11:25:32,185 INFO L226 Difference]: Without dead ends: 177 [2021-08-27 11:25:32,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-27 11:25:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 144. [2021-08-27 11:25:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 143 states have internal predecessors, (174), 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-08-27 11:25:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2021-08-27 11:25:32,188 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 48 [2021-08-27 11:25:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:32,189 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2021-08-27 11:25:32,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08-27 11:25:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2021-08-27 11:25:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 11:25:32,190 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:32,190 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:32,216 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-08-27 11:25:32,396 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-08-27 11:25:32,397 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-08-27 11:25:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash -954330780, now seen corresponding path program 1 times [2021-08-27 11:25:32,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:32,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142254462] [2021-08-27 11:25:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:32,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142254462] [2021-08-27 11:25:32,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142254462] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:32,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455463326] [2021-08-27 11:25:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:32,481 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-08-27 11:25:32,492 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-08-27 11:25:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 11:25:32,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 11:25:32,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455463326] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:32,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-08-27 11:25:32,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791432203] [2021-08-27 11:25:32,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:32,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:32,910 INFO L87 Difference]: Start difference. First operand 144 states and 174 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-08-27 11:25:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,085 INFO L93 Difference]: Finished difference Result 326 states and 420 transitions. [2021-08-27 11:25:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:33,085 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 64 [2021-08-27 11:25:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,087 INFO L225 Difference]: With dead ends: 326 [2021-08-27 11:25:33,087 INFO L226 Difference]: Without dead ends: 194 [2021-08-27 11:25:33,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-27 11:25:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2021-08-27 11:25:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2024539877300613) internal successors, (196), 163 states have internal predecessors, (196), 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-08-27 11:25:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-08-27 11:25:33,094 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 64 [2021-08-27 11:25:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,095 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-08-27 11:25:33,095 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-08-27 11:25:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-08-27 11:25:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 11:25:33,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,098 INFO L512 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] [2021-08-27 11:25:33,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-27 11:25:33,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:33,315 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-08-27 11:25:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 25170625, now seen corresponding path program 1 times [2021-08-27 11:25:33,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919901972] [2021-08-27 11:25:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-27 11:25:33,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919901972] [2021-08-27 11:25:33,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919901972] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:25:33,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605590687] [2021-08-27 11:25:33,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:33,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:33,394 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-08-27 11:25:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,581 INFO L93 Difference]: Finished difference Result 611 states and 733 transitions. [2021-08-27 11:25:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:25:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 80 [2021-08-27 11:25:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,583 INFO L225 Difference]: With dead ends: 611 [2021-08-27 11:25:33,583 INFO L226 Difference]: Without dead ends: 474 [2021-08-27 11:25:33,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-27 11:25:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 164. [2021-08-27 11:25:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2024539877300613) internal successors, (196), 163 states have internal predecessors, (196), 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-08-27 11:25:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-08-27 11:25:33,597 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 80 [2021-08-27 11:25:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,597 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-08-27 11:25:33,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-08-27 11:25:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-08-27 11:25:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:33,598 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,598 INFO L512 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-08-27 11:25:33,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 11:25:33,598 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-08-27 11:25:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash -705708941, now seen corresponding path program 1 times [2021-08-27 11:25:33,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495275227] [2021-08-27 11:25:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-08-27 11:25:33,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495275227] [2021-08-27 11:25:33,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495275227] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:25:33,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120354837] [2021-08-27 11:25:33,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:33,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:33,680 INFO L87 Difference]: Start difference. First operand 164 states and 196 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-08-27 11:25:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,751 INFO L93 Difference]: Finished difference Result 487 states and 583 transitions. [2021-08-27 11:25:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:33,751 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-08-27 11:25:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,752 INFO L225 Difference]: With dead ends: 487 [2021-08-27 11:25:33,752 INFO L226 Difference]: Without dead ends: 350 [2021-08-27 11:25:33,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-08-27 11:25:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 257. [2021-08-27 11:25:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.20703125) internal successors, (309), 256 states have internal predecessors, (309), 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-08-27 11:25:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 309 transitions. [2021-08-27 11:25:33,757 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 309 transitions. Word has length 83 [2021-08-27 11:25:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,757 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 309 transitions. [2021-08-27 11:25:33,758 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-08-27 11:25:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2021-08-27 11:25:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:33,758 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,758 INFO L512 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-08-27 11:25:33,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 11:25:33,759 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-08-27 11:25:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1924468269, now seen corresponding path program 1 times [2021-08-27 11:25:33,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806126252] [2021-08-27 11:25:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-27 11:25:33,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806126252] [2021-08-27 11:25:33,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806126252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:25:33,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088239935] [2021-08-27 11:25:33,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:33,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:33,833 INFO L87 Difference]: Start difference. First operand 257 states and 309 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-08-27 11:25:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:34,130 INFO L93 Difference]: Finished difference Result 1254 states and 1506 transitions. [2021-08-27 11:25:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 11:25:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-08-27 11:25:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:34,133 INFO L225 Difference]: With dead ends: 1254 [2021-08-27 11:25:34,133 INFO L226 Difference]: Without dead ends: 1024 [2021-08-27 11:25:34,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-08-27 11:25:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 257. [2021-08-27 11:25:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.20703125) internal successors, (309), 256 states have internal predecessors, (309), 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-08-27 11:25:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 309 transitions. [2021-08-27 11:25:34,141 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 309 transitions. Word has length 83 [2021-08-27 11:25:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:34,141 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 309 transitions. [2021-08-27 11:25:34,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-08-27 11:25:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2021-08-27 11:25:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:34,142 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:34,142 INFO L512 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-08-27 11:25:34,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 11:25:34,143 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-08-27 11:25:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash 335021134, now seen corresponding path program 1 times [2021-08-27 11:25:34,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:34,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563125735] [2021-08-27 11:25:34,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-27 11:25:34,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:34,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563125735] [2021-08-27 11:25:34,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563125735] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:34,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669524525] [2021-08-27 11:25:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,213 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:34,214 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-08-27 11:25:34,215 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-08-27 11:25:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:34,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 11:25:34,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-27 11:25:34,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669524525] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:34,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:34,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-27 11:25:34,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187744139] [2021-08-27 11:25:34,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:25:34,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:25:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:25:34,761 INFO L87 Difference]: Start difference. First operand 257 states and 309 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-08-27 11:25:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:34,915 INFO L93 Difference]: Finished difference Result 727 states and 877 transitions. [2021-08-27 11:25:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:34,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-08-27 11:25:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:34,917 INFO L225 Difference]: With dead ends: 727 [2021-08-27 11:25:34,917 INFO L226 Difference]: Without dead ends: 497 [2021-08-27 11:25:34,917 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:25:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-08-27 11:25:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 463. [2021-08-27 11:25:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.2142857142857142) internal successors, (561), 462 states have internal predecessors, (561), 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-08-27 11:25:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 561 transitions. [2021-08-27 11:25:34,926 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 561 transitions. Word has length 83 [2021-08-27 11:25:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:34,926 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 561 transitions. [2021-08-27 11:25:34,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-08-27 11:25:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 561 transitions. [2021-08-27 11:25:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-27 11:25:34,927 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:34,927 INFO L512 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-08-27 11:25:34,945 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-08-27 11:25:35,140 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,SelfDestructingSolverStorable13 [2021-08-27 11:25:35,141 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-08-27 11:25:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1183041321, now seen corresponding path program 1 times [2021-08-27 11:25:35,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:35,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945572638] [2021-08-27 11:25:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:35,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-27 11:25:35,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:35,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945572638] [2021-08-27 11:25:35,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945572638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:35,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:35,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:25:35,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475484340] [2021-08-27 11:25:35,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:35,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:35,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:35,240 INFO L87 Difference]: Start difference. First operand 463 states and 561 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-08-27 11:25:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:35,790 INFO L93 Difference]: Finished difference Result 1252 states and 1501 transitions. [2021-08-27 11:25:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 11:25:35,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 85 [2021-08-27 11:25:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:35,793 INFO L225 Difference]: With dead ends: 1252 [2021-08-27 11:25:35,793 INFO L226 Difference]: Without dead ends: 1022 [2021-08-27 11:25:35,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-08-27 11:25:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 459. [2021-08-27 11:25:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.2161572052401746) internal successors, (557), 458 states have internal predecessors, (557), 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-08-27 11:25:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 557 transitions. [2021-08-27 11:25:35,820 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 557 transitions. Word has length 85 [2021-08-27 11:25:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:35,820 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 557 transitions. [2021-08-27 11:25:35,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-08-27 11:25:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 557 transitions. [2021-08-27 11:25:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 11:25:35,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:35,821 INFO L512 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] [2021-08-27 11:25:35,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 11:25:35,821 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-08-27 11:25:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1279960591, now seen corresponding path program 1 times [2021-08-27 11:25:35,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:35,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746233649] [2021-08-27 11:25:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:35,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:35,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:35,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746233649] [2021-08-27 11:25:35,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746233649] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:35,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046725187] [2021-08-27 11:25:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:35,959 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:35,973 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-08-27 11:25:35,973 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-08-27 11:25:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:36,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 11:25:36,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 11:25:36,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046725187] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:36,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:36,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2021-08-27 11:25:36,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921866645] [2021-08-27 11:25:36,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:36,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:36,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:36,740 INFO L87 Difference]: Start difference. First operand 459 states and 557 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-08-27 11:25:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:36,877 INFO L93 Difference]: Finished difference Result 936 states and 1131 transitions. [2021-08-27 11:25:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:36,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 86 [2021-08-27 11:25:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:36,879 INFO L225 Difference]: With dead ends: 936 [2021-08-27 11:25:36,879 INFO L226 Difference]: Without dead ends: 706 [2021-08-27 11:25:36,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-08-27 11:25:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 677. [2021-08-27 11:25:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.217455621301775) internal successors, (823), 676 states have internal predecessors, (823), 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-08-27 11:25:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 823 transitions. [2021-08-27 11:25:36,892 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 823 transitions. Word has length 86 [2021-08-27 11:25:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:36,892 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 823 transitions. [2021-08-27 11:25:36,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-08-27 11:25:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 823 transitions. [2021-08-27 11:25:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 11:25:36,893 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:36,893 INFO L512 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-08-27 11:25:36,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-27 11:25:37,110 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,SelfDestructingSolverStorable15 [2021-08-27 11:25:37,111 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-08-27 11:25:37,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1767062975, now seen corresponding path program 1 times [2021-08-27 11:25:37,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:37,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548155130] [2021-08-27 11:25:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:37,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:37,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:37,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548155130] [2021-08-27 11:25:37,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548155130] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:37,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136756790] [2021-08-27 11:25:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:37,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:37,221 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-08-27 11:25:37,245 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-08-27 11:25:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:37,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 11:25:37,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 11:25:37,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136756790] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:37,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:37,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-08-27 11:25:37,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151448257] [2021-08-27 11:25:37,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 11:25:37,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:37,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 11:25:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:25:37,857 INFO L87 Difference]: Start difference. First operand 677 states and 823 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 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-08-27 11:25:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:39,490 INFO L93 Difference]: Finished difference Result 2043 states and 2461 transitions. [2021-08-27 11:25:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-27 11:25:39,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 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-08-27 11:25:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:39,494 INFO L225 Difference]: With dead ends: 2043 [2021-08-27 11:25:39,494 INFO L226 Difference]: Without dead ends: 1389 [2021-08-27 11:25:39,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 580.6ms TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2021-08-27 11:25:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2021-08-27 11:25:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 786. [2021-08-27 11:25:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.219108280254777) internal successors, (957), 785 states have internal predecessors, (957), 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-08-27 11:25:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 957 transitions. [2021-08-27 11:25:39,512 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 957 transitions. Word has length 89 [2021-08-27 11:25:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:39,513 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 957 transitions. [2021-08-27 11:25:39,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 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-08-27 11:25:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 957 transitions. [2021-08-27 11:25:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-27 11:25:39,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:39,514 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:39,533 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-08-27 11:25:39,731 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-08-27 11:25:39,731 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-08-27 11:25:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1720526203, now seen corresponding path program 1 times [2021-08-27 11:25:39,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:39,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489801430] [2021-08-27 11:25:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:39,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 11:25:39,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:39,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489801430] [2021-08-27 11:25:39,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489801430] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:39,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096365796] [2021-08-27 11:25:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:39,854 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:39,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:39,855 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-08-27 11:25:39,856 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-08-27 11:25:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:40,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 11:25:40,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 11:25:40,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096365796] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:40,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:40,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-08-27 11:25:40,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53367200] [2021-08-27 11:25:40,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 11:25:40,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:40,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 11:25:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:25:40,621 INFO L87 Difference]: Start difference. First operand 786 states and 957 transitions. Second operand has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 states have internal predecessors, (157), 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-08-27 11:25:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:41,118 INFO L93 Difference]: Finished difference Result 3238 states and 3834 transitions. [2021-08-27 11:25:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 11:25:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 states have internal predecessors, (157), 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-08-27 11:25:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:41,125 INFO L225 Difference]: With dead ends: 3238 [2021-08-27 11:25:41,126 INFO L226 Difference]: Without dead ends: 2575 [2021-08-27 11:25:41,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 200.4ms TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2021-08-27 11:25:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2021-08-27 11:25:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 1018. [2021-08-27 11:25:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.3077679449360866) internal successors, (1330), 1017 states have internal predecessors, (1330), 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-08-27 11:25:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1330 transitions. [2021-08-27 11:25:41,162 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1330 transitions. Word has length 91 [2021-08-27 11:25:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:41,162 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 1330 transitions. [2021-08-27 11:25:41,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 states have internal predecessors, (157), 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-08-27 11:25:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1330 transitions. [2021-08-27 11:25:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-27 11:25:41,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:41,163 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:41,183 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-08-27 11:25:41,380 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,SelfDestructingSolverStorable17 [2021-08-27 11:25:41,381 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-08-27 11:25:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:41,381 INFO L82 PathProgramCache]: Analyzing trace with hash -717591297, now seen corresponding path program 1 times [2021-08-27 11:25:41,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:41,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977309983] [2021-08-27 11:25:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:41,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 11:25:41,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:41,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977309983] [2021-08-27 11:25:41,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977309983] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:41,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167655138] [2021-08-27 11:25:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:41,447 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:41,448 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-08-27 11:25:41,449 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-08-27 11:25:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:41,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:41,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-27 11:25:42,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167655138] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:42,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:42,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-08-27 11:25:42,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914424574] [2021-08-27 11:25:42,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:42,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:42,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:42,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:42,009 INFO L87 Difference]: Start difference. First operand 1018 states and 1330 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-08-27 11:25:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:42,223 INFO L93 Difference]: Finished difference Result 1437 states and 1873 transitions. [2021-08-27 11:25:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:25:42,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 97 [2021-08-27 11:25:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:42,227 INFO L225 Difference]: With dead ends: 1437 [2021-08-27 11:25:42,227 INFO L226 Difference]: Without dead ends: 1044 [2021-08-27 11:25:42,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 46.1ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:25:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-08-27 11:25:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1031. [2021-08-27 11:25:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1030 states have (on average 1.2854368932038835) internal successors, (1324), 1030 states have internal predecessors, (1324), 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-08-27 11:25:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1324 transitions. [2021-08-27 11:25:42,247 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1324 transitions. Word has length 97 [2021-08-27 11:25:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:42,248 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1324 transitions. [2021-08-27 11:25:42,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-08-27 11:25:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1324 transitions. [2021-08-27 11:25:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-27 11:25:42,250 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:42,250 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1] [2021-08-27 11:25:42,285 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-08-27 11:25:42,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:42,467 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-08-27 11:25:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1305223133, now seen corresponding path program 1 times [2021-08-27 11:25:42,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:42,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865189504] [2021-08-27 11:25:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:42,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-08-27 11:25:42,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:42,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865189504] [2021-08-27 11:25:42,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865189504] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:42,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162287273] [2021-08-27 11:25:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:42,581 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:42,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:42,597 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-08-27 11:25:42,621 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-08-27 11:25:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:43,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 11:25:43,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 24 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-27 11:25:43,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162287273] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:43,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:43,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-08-27 11:25:43,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003221676] [2021-08-27 11:25:43,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 11:25:43,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 11:25:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:43,677 INFO L87 Difference]: Start difference. First operand 1031 states and 1324 transitions. Second operand has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 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-08-27 11:25:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:44,129 INFO L93 Difference]: Finished difference Result 2830 states and 3450 transitions. [2021-08-27 11:25:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 11:25:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 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 98 [2021-08-27 11:25:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:44,143 INFO L225 Difference]: With dead ends: 2830 [2021-08-27 11:25:44,143 INFO L226 Difference]: Without dead ends: 2793 [2021-08-27 11:25:44,144 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 137.1ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-08-27 11:25:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2021-08-27 11:25:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 967. [2021-08-27 11:25:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 1.284679089026915) internal successors, (1241), 966 states have internal predecessors, (1241), 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-08-27 11:25:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1241 transitions. [2021-08-27 11:25:44,171 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1241 transitions. Word has length 98 [2021-08-27 11:25:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:44,171 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1241 transitions. [2021-08-27 11:25:44,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 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-08-27 11:25:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1241 transitions. [2021-08-27 11:25:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 11:25:44,173 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:44,173 INFO L512 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-08-27 11:25:44,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-27 11:25:44,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:44,391 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-08-27 11:25:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-08-27 11:25:44,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:44,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461659037] [2021-08-27 11:25:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:44,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:25:44,427 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 11:25:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:25:44,466 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 11:25:44,466 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 11:25:44,467 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:44,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 11:25:44,479 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 11:25:44,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:25:44 BoogieIcfgContainer [2021-08-27 11:25:44,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 11:25:44,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 11:25:44,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 11:25:44,540 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 11:25:44,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:28" (3/4) ... [2021-08-27 11:25:44,542 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 11:25:44,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 11:25:44,543 INFO L168 Benchmark]: Toolchain (without parser) took 16744.34 ms. Allocated memory was 50.3 MB in the beginning and 308.3 MB in the end (delta: 257.9 MB). Free memory was 27.8 MB in the beginning and 244.5 MB in the end (delta: -216.7 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:44,543 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 32.1 MB in the end (delta: 37.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:44,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.06 ms. Allocated memory was 50.3 MB in the beginning and 69.2 MB in the end (delta: 18.9 MB). Free memory was 27.7 MB in the beginning and 52.0 MB in the end (delta: -24.4 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:44,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.22 ms. Allocated memory is still 69.2 MB. Free memory was 52.0 MB in the beginning and 50.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:44,545 INFO L168 Benchmark]: Boogie Preprocessor took 16.79 ms. Allocated memory is still 69.2 MB. Free memory was 50.0 MB in the beginning and 48.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:44,545 INFO L168 Benchmark]: RCFGBuilder took 520.88 ms. Allocated memory is still 69.2 MB. Free memory was 48.4 MB in the beginning and 38.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:44,545 INFO L168 Benchmark]: TraceAbstraction took 15880.34 ms. Allocated memory was 69.2 MB in the beginning and 308.3 MB in the end (delta: 239.1 MB). Free memory was 38.4 MB in the beginning and 244.5 MB in the end (delta: -206.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:44,545 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 308.3 MB. Free memory is still 244.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:44,546 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.15 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 32.1 MB in the end (delta: 37.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 278.06 ms. Allocated memory was 50.3 MB in the beginning and 69.2 MB in the end (delta: 18.9 MB). Free memory was 27.7 MB in the beginning and 52.0 MB in the end (delta: -24.4 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 25.22 ms. Allocated memory is still 69.2 MB. Free memory was 52.0 MB in the beginning and 50.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 16.79 ms. Allocated memory is still 69.2 MB. Free memory was 50.0 MB in the beginning and 48.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 520.88 ms. Allocated memory is still 69.2 MB. Free memory was 48.4 MB in the beginning and 38.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15880.34 ms. Allocated memory was 69.2 MB in the beginning and 308.3 MB in the end (delta: 239.1 MB). Free memory was 38.4 MB in the beginning and 244.5 MB in the end (delta: -206.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.78 ms. Allocated memory is still 308.3 MB. Free memory is still 244.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 88. Possible FailurePath: [L116] unsigned int a, b, r; [L118] b = __VERIFIER_nondet_uint() [L120] a = 234770789 [L34] unsigned char a0, a1, a2, a3; [L35] unsigned char b0, b1, b2, b3; [L36] unsigned char r0, r1, r2, r3; [L37] unsigned short carry; [L38] unsigned short partial_sum; [L39] unsigned int r; [L40] unsigned char i; [L41] unsigned char na, nb; [L42] a0 = a [L43] a1 = a >> 8 [L44] a2 = a >> 16U [L45] a3 = a >> 24U [L46] b0 = b [L47] b1 = b >> 8U [L48] b2 = b >> 16U [L49] b3 = b >> 24U [L50] na = (unsigned char)4 [L51] COND FALSE !(a3 == (unsigned char)0) [L60] nb = (unsigned char)4 [L61] COND FALSE !(b3 == (unsigned char)0) [L70] carry = (unsigned short)0 [L71] i = (unsigned char)0 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND TRUE i == (unsigned char)0 [L76] EXPR partial_sum + a0 [L76] partial_sum = partial_sum + a0 [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND TRUE i == (unsigned char)0 [L82] EXPR partial_sum + b0 [L82] partial_sum = partial_sum + b0 [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)255) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND TRUE i == (unsigned char)0 [L91] r0 = (unsigned char)partial_sum [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND FALSE !(i == (unsigned char)0) [L77] COND TRUE i == (unsigned char)1 [L77] EXPR partial_sum + a1 [L77] partial_sum = partial_sum + a1 [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND TRUE i == (unsigned char)1 [L83] EXPR partial_sum + b1 [L83] partial_sum = partial_sum + b1 [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)255) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND FALSE !(i == (unsigned char)0) [L92] COND TRUE i == (unsigned char)1 [L92] r1 = (unsigned char)partial_sum [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND FALSE !(i == (unsigned char)0) [L77] COND FALSE !(i == (unsigned char)1) [L78] COND TRUE i == (unsigned char)2 [L78] EXPR partial_sum + a2 [L78] partial_sum = partial_sum + a2 [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND TRUE i == (unsigned char)2 [L84] EXPR partial_sum + b2 [L84] partial_sum = partial_sum + b2 [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)255) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND TRUE i == (unsigned char)2 [L93] r2 = (unsigned char)partial_sum [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND FALSE !(i == (unsigned char)0) [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND TRUE i == (unsigned char)3 [L79] EXPR partial_sum + a3 [L79] partial_sum = partial_sum + a3 [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND TRUE i == (unsigned char)3 [L85] EXPR partial_sum + b3 [L85] partial_sum = partial_sum + b3 [L87] COND FALSE !(partial_sum > ((unsigned char)255)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND TRUE i == (unsigned char)3 [L94] r3 = (unsigned char)partial_sum [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND FALSE !(i < (unsigned char)4) [L108] r1 << 8U [L108] r2 << 16U [L108] r3 << 24U - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: 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: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 83]: 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: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: 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: 15767.2ms, OverallIterations: 21, TraceHistogramMax: 4, EmptinessCheckTime: 23.9ms, AutomataDifference: 5420.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2322 SDtfs, 3707 SDslu, 5828 SDs, 0 SdLazy, 4884 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3111.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 926 GetRequests, 748 SyntacticMatches, 14 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1477.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1031occurred in iteration=19, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 223.0ms AutomataMinimizationTime, 20 MinimizatonAttempts, 6038 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 105.2ms SsaConstructionTime, 1075.3ms SatisfiabilityAnalysisTime, 4651.9ms InterpolantComputationTime, 2004 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1873 ConstructedInterpolants, 4 QuantifiedInterpolants, 9901 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1723 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 1372/1572 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-08-27 11:25:44,569 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...