./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 499e83f84eda8d3ed438ea1340f9ee54d9540a66 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-wip.dd.seqcomp-5fbdf5b [2021-08-30 22:45:31,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 22:45:31,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 22:45:31,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 22:45:31,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 22:45:31,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 22:45:31,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 22:45:31,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 22:45:31,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 22:45:31,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 22:45:31,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 22:45:31,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 22:45:31,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 22:45:31,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 22:45:31,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 22:45:31,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 22:45:31,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 22:45:31,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 22:45:31,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 22:45:31,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 22:45:31,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 22:45:31,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 22:45:31,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 22:45:31,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 22:45:31,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 22:45:31,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 22:45:31,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 22:45:31,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 22:45:31,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 22:45:31,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 22:45:31,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 22:45:31,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 22:45:31,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 22:45:31,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 22:45:31,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 22:45:31,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 22:45:31,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 22:45:31,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 22:45:31,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 22:45:31,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 22:45:31,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 22:45:31,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-08-30 22:45:31,671 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 22:45:31,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 22:45:31,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 22:45:31,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 22:45:31,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 22:45:31,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 22:45:31,674 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 22:45:31,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 22:45:31,675 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 22:45:31,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 22:45:31,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 22:45:31,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 22:45:31,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 22:45:31,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-30 22:45:31,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 22:45:31,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-30 22:45:31,677 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-30 22:45:31,677 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 22:45:31,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-30 22:45:31,678 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 22:45:31,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-30 22:45:31,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 22:45:31,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 22:45:31,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 22:45:31,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 22:45:31,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 22:45:31,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 22:45:31,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-30 22:45:31,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 22:45:31,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 22:45:31,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-30 22:45:31,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 22:45:31,689 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 -> 499e83f84eda8d3ed438ea1340f9ee54d9540a66 [2021-08-30 22:45:31,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 22:45:32,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 22:45:32,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 22:45:32,014 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 22:45:32,015 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 22:45:32,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-08-30 22:45:32,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85ae88af/187328f1fedf437b8ef85d4cb310ea76/FLAG861d4a980 [2021-08-30 22:45:32,517 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 22:45:32,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-08-30 22:45:32,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85ae88af/187328f1fedf437b8ef85d4cb310ea76/FLAG861d4a980 [2021-08-30 22:45:32,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85ae88af/187328f1fedf437b8ef85d4cb310ea76 [2021-08-30 22:45:32,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 22:45:32,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-30 22:45:32,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 22:45:32,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 22:45:32,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 22:45:32,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6973e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32, skipping insertion in model container [2021-08-30 22:45:32,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 22:45:32,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 22:45:32,739 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_2-1.i[863,876] [2021-08-30 22:45:32,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 22:45:32,795 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 22:45:32,817 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_2-1.i[863,876] [2021-08-30 22:45:32,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 22:45:32,865 INFO L208 MainTranslator]: Completed translation [2021-08-30 22:45:32,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32 WrapperNode [2021-08-30 22:45:32,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 22:45:32,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-30 22:45:32,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-30 22:45:32,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-30 22:45:32,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-30 22:45:32,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 22:45:32,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 22:45:32,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 22:45:32,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 22:45:32,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 22:45:32,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 22:45:32,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 22:45:32,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (1/1) ... [2021-08-30 22:45:32,977 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 22:45:32,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:32,997 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-30 22:45:33,005 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-30 22:45:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-30 22:45:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 22:45:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 22:45:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 22:45:33,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 22:45:33,243 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-30 22:45:33,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:45:33 BoogieIcfgContainer [2021-08-30 22:45:33,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 22:45:33,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 22:45:33,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 22:45:33,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 22:45:33,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 10:45:32" (1/3) ... [2021-08-30 22:45:33,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b69916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:45:33, skipping insertion in model container [2021-08-30 22:45:33,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:45:32" (2/3) ... [2021-08-30 22:45:33,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b69916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:45:33, skipping insertion in model container [2021-08-30 22:45:33,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:45:33" (3/3) ... [2021-08-30 22:45:33,254 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2021-08-30 22:45:33,258 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 22:45:33,258 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-08-30 22:45:33,304 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 22:45:33,309 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-30 22:45:33,310 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-08-30 22:45:33,324 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-30 22:45:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-30 22:45:33,327 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:33,328 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-30 22:45:33,328 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-30 22:45:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-08-30 22:45:33,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:33,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355271956] [2021-08-30 22:45:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:33,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:33,534 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-30 22:45:33,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:33,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355271956] [2021-08-30 22:45:33,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355271956] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:33,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:33,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-30 22:45:33,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126980278] [2021-08-30 22:45:33,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-30 22:45:33,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:33,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-30 22:45:33,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-30 22:45:33,561 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-30 22:45:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:33,758 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-08-30 22:45:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-30 22:45:33,760 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-30 22:45:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:33,768 INFO L225 Difference]: With dead ends: 135 [2021-08-30 22:45:33,772 INFO L226 Difference]: Without dead ends: 69 [2021-08-30 22:45:33,775 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-30 22:45:33,778 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 177.20ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:33,782 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 103 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 177.20ms Time] [2021-08-30 22:45:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-30 22:45:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-30 22:45:33,816 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-30 22:45:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-08-30 22:45:33,824 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-08-30 22:45:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:33,824 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-08-30 22:45:33,825 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-30 22:45:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-08-30 22:45:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 22:45:33,826 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:33,826 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 22:45:33,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 22:45:33,827 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-30 22:45:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-08-30 22:45:33,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:33,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617437705] [2021-08-30 22:45:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:33,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:33,947 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-30 22:45:33,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:33,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617437705] [2021-08-30 22:45:33,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617437705] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:33,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:33,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 22:45:33,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256886342] [2021-08-30 22:45:33,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 22:45:33,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 22:45:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 22:45:33,952 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-30 22:45:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:34,189 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-08-30 22:45:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 22:45:34,190 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-30 22:45:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:34,191 INFO L225 Difference]: With dead ends: 145 [2021-08-30 22:45:34,191 INFO L226 Difference]: Without dead ends: 98 [2021-08-30 22:45:34,192 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.09ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 22:45:34,193 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 163.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.33ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 210.46ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:34,194 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 2.33ms Time], IncrementalHoareTripleChecker [16 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 210.46ms Time] [2021-08-30 22:45:34,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-30 22:45:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-08-30 22:45:34,201 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-30 22:45:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-08-30 22:45:34,202 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-08-30 22:45:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:34,202 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-08-30 22:45:34,202 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-30 22:45:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-08-30 22:45:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 22:45:34,203 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:34,203 INFO L513 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-30 22:45:34,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 22:45:34,204 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-30 22:45:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-08-30 22:45:34,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:34,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75594] [2021-08-30 22:45:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:34,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:34,334 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-30 22:45:34,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:34,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75594] [2021-08-30 22:45:34,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75594] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:34,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:34,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 22:45:34,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715039547] [2021-08-30 22:45:34,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 22:45:34,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 22:45:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 22:45:34,337 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-30 22:45:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:34,656 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-08-30 22:45:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 22:45:34,657 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-30 22:45:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:34,658 INFO L225 Difference]: With dead ends: 221 [2021-08-30 22:45:34,658 INFO L226 Difference]: Without dead ends: 164 [2021-08-30 22:45:34,658 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.99ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 22:45:34,659 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 235.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.91ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 292.82ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:34,660 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 401 Unknown, 0 Unchecked, 2.91ms Time], IncrementalHoareTripleChecker [2 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 292.82ms Time] [2021-08-30 22:45:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-30 22:45:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-08-30 22:45:34,676 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-30 22:45:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-08-30 22:45:34,677 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-08-30 22:45:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:34,678 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-08-30 22:45:34,678 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-30 22:45:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-08-30 22:45:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-30 22:45:34,679 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:34,679 INFO L513 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-30 22:45:34,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 22:45:34,680 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-30 22:45:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-08-30 22:45:34,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:34,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167893597] [2021-08-30 22:45:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:34,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:34,732 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-30 22:45:34,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:34,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167893597] [2021-08-30 22:45:34,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167893597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:34,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:34,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 22:45:34,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074961871] [2021-08-30 22:45:34,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 22:45:34,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 22:45:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 22:45:34,735 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:34,833 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2021-08-30 22:45:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 22:45:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-30 22:45:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:34,835 INFO L225 Difference]: With dead ends: 162 [2021-08-30 22:45:34,835 INFO L226 Difference]: Without dead ends: 81 [2021-08-30 22:45:34,835 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.00ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 22:45:34,836 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.09ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:34,837 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 94.09ms Time] [2021-08-30 22:45:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-30 22:45:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-08-30 22:45:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2021-08-30 22:45:34,842 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 23 [2021-08-30 22:45:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:34,842 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2021-08-30 22:45:34,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2021-08-30 22:45:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-30 22:45:34,843 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:34,843 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 22:45:34,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 22:45:34,843 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-30 22:45:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1486873965, now seen corresponding path program 1 times [2021-08-30 22:45:34,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:34,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143772876] [2021-08-30 22:45:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:34,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:34,934 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-30 22:45:34,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:34,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143772876] [2021-08-30 22:45:34,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143772876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:34,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:34,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 22:45:34,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484003761] [2021-08-30 22:45:34,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 22:45:34,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 22:45:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 22:45:34,936 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:35,070 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2021-08-30 22:45:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 22:45:35,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-30 22:45:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:35,071 INFO L225 Difference]: With dead ends: 105 [2021-08-30 22:45:35,071 INFO L226 Difference]: Without dead ends: 92 [2021-08-30 22:45:35,072 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.82ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 22:45:35,073 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.51ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.00ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:35,073 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.51ms Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 129.00ms Time] [2021-08-30 22:45:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-30 22:45:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-08-30 22:45:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2021-08-30 22:45:35,084 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 29 [2021-08-30 22:45:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:35,084 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2021-08-30 22:45:35,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-08-30 22:45:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-30 22:45:35,086 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:35,086 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 22:45:35,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-30 22:45:35,086 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-30 22:45:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:35,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1796976081, now seen corresponding path program 1 times [2021-08-30 22:45:35,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:35,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426683733] [2021-08-30 22:45:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:35,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:35,200 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-30 22:45:35,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:35,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426683733] [2021-08-30 22:45:35,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426683733] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:35,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:35,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 22:45:35,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424515004] [2021-08-30 22:45:35,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 22:45:35,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 22:45:35,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 22:45:35,203 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:35,476 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2021-08-30 22:45:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 22:45:35,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-30 22:45:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:35,478 INFO L225 Difference]: With dead ends: 247 [2021-08-30 22:45:35,478 INFO L226 Difference]: Without dead ends: 177 [2021-08-30 22:45:35,478 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.28ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 22:45:35,479 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 190.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 248.46ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:35,479 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 375 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 248.46ms Time] [2021-08-30 22:45:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-30 22:45:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2021-08-30 22:45:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2021-08-30 22:45:35,496 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 29 [2021-08-30 22:45:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:35,497 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2021-08-30 22:45:35,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2021-08-30 22:45:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 22:45:35,500 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:35,500 INFO L513 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-30 22:45:35,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-30 22:45:35,501 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-30 22:45:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 543877549, now seen corresponding path program 1 times [2021-08-30 22:45:35,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:35,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725968475] [2021-08-30 22:45:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:35,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:35,591 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-30 22:45:35,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:35,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725968475] [2021-08-30 22:45:35,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725968475] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:35,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555436833] [2021-08-30 22:45:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:35,593 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:35,594 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-30 22:45:35,630 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-30 22:45:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:35,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 22:45:35,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:35,948 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-30 22:45:35,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 22:45:35,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555436833] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:35,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 22:45:35,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-30 22:45:35,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501593831] [2021-08-30 22:45:35,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 22:45:35,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:35,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 22:45:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-30 22:45:35,951 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:36,181 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2021-08-30 22:45:36,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 22:45:36,181 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-30 22:45:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:36,182 INFO L225 Difference]: With dead ends: 213 [2021-08-30 22:45:36,182 INFO L226 Difference]: Without dead ends: 159 [2021-08-30 22:45:36,183 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.46ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-30 22:45:36,184 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.70ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 217.18ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:36,184 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 300 Unknown, 0 Unchecked, 1.70ms Time], IncrementalHoareTripleChecker [35 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 217.18ms Time] [2021-08-30 22:45:36,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-30 22:45:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2021-08-30 22:45:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 137 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-30 22:45:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2021-08-30 22:45:36,201 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 32 [2021-08-30 22:45:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:36,201 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2021-08-30 22:45:36,202 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-30 22:45:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2021-08-30 22:45:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 22:45:36,206 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:36,207 INFO L513 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-30 22:45:36,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-30 22:45:36,419 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-30 22:45:36,420 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-30 22:45:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 372269661, now seen corresponding path program 1 times [2021-08-30 22:45:36,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:36,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220080160] [2021-08-30 22:45:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:36,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:36,539 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-30 22:45:36,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:36,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220080160] [2021-08-30 22:45:36,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220080160] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:36,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747224361] [2021-08-30 22:45:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:36,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:36,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 22:45:36,543 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-30 22:45:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:36,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 22:45:36,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:36,857 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-30 22:45:36,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 22:45:36,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747224361] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:36,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 22:45:36,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-08-30 22:45:36,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433935302] [2021-08-30 22:45:36,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 22:45:36,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 22:45:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-30 22:45:36,860 INFO L87 Difference]: Start difference. First operand 138 states and 172 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-30 22:45:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:37,014 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2021-08-30 22:45:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 22:45:37,014 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-30 22:45:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:37,015 INFO L225 Difference]: With dead ends: 255 [2021-08-30 22:45:37,015 INFO L226 Difference]: Without dead ends: 139 [2021-08-30 22:45:37,016 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 47.87ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-30 22:45:37,016 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 139.69ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:37,017 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [12 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 139.69ms Time] [2021-08-30 22:45:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-30 22:45:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2021-08-30 22:45:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 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-30 22:45:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-08-30 22:45:37,030 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 39 [2021-08-30 22:45:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:37,031 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-08-30 22:45:37,031 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-30 22:45:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-08-30 22:45:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-30 22:45:37,033 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:37,034 INFO L513 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-30 22:45:37,063 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-30 22:45:37,261 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-30 22:45:37,261 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-30 22:45:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:37,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1054853098, now seen corresponding path program 1 times [2021-08-30 22:45:37,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:37,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438386327] [2021-08-30 22:45:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:37,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-30 22:45:37,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:37,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438386327] [2021-08-30 22:45:37,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438386327] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:37,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:37,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 22:45:37,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863903893] [2021-08-30 22:45:37,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 22:45:37,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 22:45:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 22:45:37,345 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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-30 22:45:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:37,558 INFO L93 Difference]: Finished difference Result 326 states and 434 transitions. [2021-08-30 22:45:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 22:45:37,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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-30 22:45:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:37,560 INFO L225 Difference]: With dead ends: 326 [2021-08-30 22:45:37,560 INFO L226 Difference]: Without dead ends: 230 [2021-08-30 22:45:37,561 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.68ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 22:45:37,561 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.46ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 196.45ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:37,561 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 255 Unknown, 0 Unchecked, 1.46ms Time], IncrementalHoareTripleChecker [30 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 196.45ms Time] [2021-08-30 22:45:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-30 22:45:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2021-08-30 22:45:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 155 states have internal predecessors, (206), 0 states have call successors, (0), 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-30 22:45:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2021-08-30 22:45:37,568 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 48 [2021-08-30 22:45:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:37,568 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2021-08-30 22:45:37,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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-30 22:45:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2021-08-30 22:45:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-30 22:45:37,569 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:37,569 INFO L513 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-30 22:45:37,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-30 22:45:37,570 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-30 22:45:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash -847771261, now seen corresponding path program 1 times [2021-08-30 22:45:37,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:37,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139957077] [2021-08-30 22:45:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:37,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-30 22:45:37,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:37,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139957077] [2021-08-30 22:45:37,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139957077] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:37,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 22:45:37,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 22:45:37,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48988658] [2021-08-30 22:45:37,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 22:45:37,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:37,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 22:45:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 22:45:37,641 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-30 22:45:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:37,861 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2021-08-30 22:45:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 22:45:37,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-30 22:45:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:37,863 INFO L225 Difference]: With dead ends: 430 [2021-08-30 22:45:37,863 INFO L226 Difference]: Without dead ends: 295 [2021-08-30 22:45:37,864 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.29ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 22:45:37,864 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.93ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 204.42ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:37,865 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 248 Unknown, 0 Unchecked, 0.93ms Time], IncrementalHoareTripleChecker [27 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 204.42ms Time] [2021-08-30 22:45:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-30 22:45:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2021-08-30 22:45:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 194 states have internal predecessors, (269), 0 states have call successors, (0), 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-30 22:45:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2021-08-30 22:45:37,871 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 64 [2021-08-30 22:45:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:37,872 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2021-08-30 22:45:37,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-30 22:45:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2021-08-30 22:45:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-30 22:45:37,873 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:37,873 INFO L513 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-30 22:45:37,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-30 22:45:37,874 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-30 22:45:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash 220871532, now seen corresponding path program 1 times [2021-08-30 22:45:37,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:37,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351188154] [2021-08-30 22:45:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:37,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-30 22:45:38,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:38,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351188154] [2021-08-30 22:45:38,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351188154] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:38,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540179188] [2021-08-30 22:45:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:38,047 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:38,048 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-30 22:45:38,077 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-30 22:45:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:38,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 22:45:38,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-30 22:45:38,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 22:45:38,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540179188] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:38,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 22:45:38,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-08-30 22:45:38,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623879723] [2021-08-30 22:45:38,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 22:45:38,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 22:45:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-30 22:45:38,421 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-30 22:45:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:38,781 INFO L93 Difference]: Finished difference Result 861 states and 1221 transitions. [2021-08-30 22:45:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 22:45:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 80 [2021-08-30 22:45:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:38,785 INFO L225 Difference]: With dead ends: 861 [2021-08-30 22:45:38,785 INFO L226 Difference]: Without dead ends: 680 [2021-08-30 22:45:38,785 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 60.52ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-30 22:45:38,786 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 260.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.79ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 326.48ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:38,786 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 618 Unknown, 0 Unchecked, 1.79ms Time], IncrementalHoareTripleChecker [20 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 326.48ms Time] [2021-08-30 22:45:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-08-30 22:45:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 393. [2021-08-30 22:45:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.346938775510204) internal successors, (528), 392 states have internal predecessors, (528), 0 states have call successors, (0), 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-30 22:45:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 528 transitions. [2021-08-30 22:45:38,799 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 528 transitions. Word has length 80 [2021-08-30 22:45:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:38,799 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 528 transitions. [2021-08-30 22:45:38,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-30 22:45:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 528 transitions. [2021-08-30 22:45:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-30 22:45:38,801 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:38,801 INFO L513 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-30 22:45:38,829 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-30 22:45:39,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:39,029 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-30 22:45:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-08-30 22:45:39,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:39,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121052757] [2021-08-30 22:45:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:39,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-30 22:45:39,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:39,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121052757] [2021-08-30 22:45:39,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121052757] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:39,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805027549] [2021-08-30 22:45:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:39,130 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:39,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:39,131 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-30 22:45:39,157 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-30 22:45:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:39,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 22:45:39,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:39,495 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-30 22:45:39,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 22:45:39,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805027549] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:39,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 22:45:39,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-08-30 22:45:39,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002740699] [2021-08-30 22:45:39,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 22:45:39,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 22:45:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-30 22:45:39,499 INFO L87 Difference]: Start difference. First operand 393 states and 528 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-30 22:45:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:39,698 INFO L93 Difference]: Finished difference Result 1276 states and 1709 transitions. [2021-08-30 22:45:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 22:45:39,698 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-30 22:45:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:39,701 INFO L225 Difference]: With dead ends: 1276 [2021-08-30 22:45:39,701 INFO L226 Difference]: Without dead ends: 906 [2021-08-30 22:45:39,702 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 52.85ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-30 22:45:39,703 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.22ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 169.14ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:39,703 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 304 Unknown, 0 Unchecked, 1.22ms Time], IncrementalHoareTripleChecker [22 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 169.14ms Time] [2021-08-30 22:45:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-08-30 22:45:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 661. [2021-08-30 22:45:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.362121212121212) internal successors, (899), 660 states have internal predecessors, (899), 0 states have call successors, (0), 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-30 22:45:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 899 transitions. [2021-08-30 22:45:39,720 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 899 transitions. Word has length 83 [2021-08-30 22:45:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:39,720 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 899 transitions. [2021-08-30 22:45:39,720 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-30 22:45:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 899 transitions. [2021-08-30 22:45:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-30 22:45:39,722 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:39,722 INFO L513 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-30 22:45:39,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-30 22:45:39,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:39,941 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-30 22:45:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash -45908259, now seen corresponding path program 1 times [2021-08-30 22:45:39,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:39,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595376075] [2021-08-30 22:45:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:39,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-30 22:45:40,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:40,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595376075] [2021-08-30 22:45:40,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595376075] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:40,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909951592] [2021-08-30 22:45:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:40,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:40,073 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-30 22:45:40,074 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-30 22:45:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:40,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-30 22:45:40,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-30 22:45:40,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 22:45:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-30 22:45:41,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909951592] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 22:45:41,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 22:45:41,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-08-30 22:45:41,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654517467] [2021-08-30 22:45:41,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-30 22:45:41,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:41,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-30 22:45:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-08-30 22:45:41,272 INFO L87 Difference]: Start difference. First operand 661 states and 899 transitions. Second operand has 17 states, 16 states have (on average 10.5) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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-30 22:45:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:43,392 INFO L93 Difference]: Finished difference Result 3819 states and 5045 transitions. [2021-08-30 22:45:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-30 22:45:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 10.5) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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-30 22:45:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:43,407 INFO L225 Difference]: With dead ends: 3819 [2021-08-30 22:45:43,408 INFO L226 Difference]: Without dead ends: 3728 [2021-08-30 22:45:43,409 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 713.73ms TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-08-30 22:45:43,411 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 532 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1195.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.55ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1428.45ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:43,411 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 0 Invalid, 2067 Unknown, 0 Unchecked, 8.55ms Time], IncrementalHoareTripleChecker [75 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1428.45ms Time] [2021-08-30 22:45:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2021-08-30 22:45:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 881. [2021-08-30 22:45:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.3806818181818181) internal successors, (1215), 880 states have internal predecessors, (1215), 0 states have call successors, (0), 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-30 22:45:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1215 transitions. [2021-08-30 22:45:43,456 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1215 transitions. Word has length 83 [2021-08-30 22:45:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:43,457 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 1215 transitions. [2021-08-30 22:45:43,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 10.5) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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-30 22:45:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1215 transitions. [2021-08-30 22:45:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-30 22:45:43,462 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:43,463 INFO L513 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, 1, 1, 1, 1, 1, 1] [2021-08-30 22:45:43,471 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-30 22:45:43,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-30 22:45:43,668 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-30 22:45:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1566001815, now seen corresponding path program 1 times [2021-08-30 22:45:43,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:43,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342064568] [2021-08-30 22:45:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:43,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-30 22:45:43,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:43,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342064568] [2021-08-30 22:45:43,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342064568] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:43,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934838056] [2021-08-30 22:45:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:43,722 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:43,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:43,736 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-30 22:45:43,737 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-30 22:45:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:43,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 22:45:43,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-30 22:45:43,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 22:45:43,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934838056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 22:45:43,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 22:45:43,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-08-30 22:45:43,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826088698] [2021-08-30 22:45:43,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 22:45:43,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:43,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 22:45:43,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 22:45:43,983 INFO L87 Difference]: Start difference. First operand 881 states and 1215 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-30 22:45:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:44,132 INFO L93 Difference]: Finished difference Result 1837 states and 2515 transitions. [2021-08-30 22:45:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 22:45:44,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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 89 [2021-08-30 22:45:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:44,137 INFO L225 Difference]: With dead ends: 1837 [2021-08-30 22:45:44,137 INFO L226 Difference]: Without dead ends: 1302 [2021-08-30 22:45:44,138 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.43ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 22:45:44,139 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 132.71ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:44,139 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 0.48ms Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 132.71ms Time] [2021-08-30 22:45:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-08-30 22:45:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1064. [2021-08-30 22:45:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 1.3734713076199436) internal successors, (1460), 1063 states have internal predecessors, (1460), 0 states have call successors, (0), 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-30 22:45:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1460 transitions. [2021-08-30 22:45:44,163 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1460 transitions. Word has length 89 [2021-08-30 22:45:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:44,163 INFO L470 AbstractCegarLoop]: Abstraction has 1064 states and 1460 transitions. [2021-08-30 22:45:44,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-30 22:45:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1460 transitions. [2021-08-30 22:45:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-30 22:45:44,165 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:44,166 INFO L513 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] [2021-08-30 22:45:44,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-30 22:45:44,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:44,385 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-30 22:45:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:44,385 INFO L82 PathProgramCache]: Analyzing trace with hash 824037263, now seen corresponding path program 1 times [2021-08-30 22:45:44,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:44,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521251328] [2021-08-30 22:45:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:44,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-30 22:45:44,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:44,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521251328] [2021-08-30 22:45:44,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521251328] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:44,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753473482] [2021-08-30 22:45:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:44,453 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:44,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:44,454 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-30 22:45:44,478 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-30 22:45:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:44,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 22:45:44,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-30 22:45:44,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 22:45:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-30 22:45:44,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753473482] provided 1 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:44,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-08-30 22:45:44,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2021-08-30 22:45:44,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189762959] [2021-08-30 22:45:44,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 22:45:44,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:44,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 22:45:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-08-30 22:45:44,948 INFO L87 Difference]: Start difference. First operand 1064 states and 1460 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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-30 22:45:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:45,256 INFO L93 Difference]: Finished difference Result 3241 states and 4476 transitions. [2021-08-30 22:45:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 22:45:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 95 [2021-08-30 22:45:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:45,263 INFO L225 Difference]: With dead ends: 3241 [2021-08-30 22:45:45,263 INFO L226 Difference]: Without dead ends: 2200 [2021-08-30 22:45:45,265 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 57.13ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-30 22:45:45,265 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 213.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.05ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 261.16ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:45,266 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 1.05ms Time], IncrementalHoareTripleChecker [36 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 261.16ms Time] [2021-08-30 22:45:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2021-08-30 22:45:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1867. [2021-08-30 22:45:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1866 states have (on average 1.4013933547695605) internal successors, (2615), 1866 states have internal predecessors, (2615), 0 states have call successors, (0), 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-30 22:45:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2615 transitions. [2021-08-30 22:45:45,311 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2615 transitions. Word has length 95 [2021-08-30 22:45:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:45,311 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2615 transitions. [2021-08-30 22:45:45,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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-30 22:45:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2615 transitions. [2021-08-30 22:45:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-30 22:45:45,325 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:45,325 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 22:45:45,349 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-30 22:45:45,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:45,544 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-30 22:45:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1030693642, now seen corresponding path program 1 times [2021-08-30 22:45:45,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:45,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218190241] [2021-08-30 22:45:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:45,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-08-30 22:45:45,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:45,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218190241] [2021-08-30 22:45:45,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218190241] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:45,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627787035] [2021-08-30 22:45:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:45,658 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:45,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:45,661 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-30 22:45:45,683 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-30 22:45:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:45,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 22:45:45,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-08-30 22:45:46,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 22:45:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-08-30 22:45:47,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627787035] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 22:45:47,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 22:45:47,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2021-08-30 22:45:47,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824548187] [2021-08-30 22:45:47,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 22:45:47,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:47,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 22:45:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-30 22:45:47,193 INFO L87 Difference]: Start difference. First operand 1867 states and 2615 transitions. Second operand has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 0 states have call successors, (0), 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-30 22:45:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:48,909 INFO L93 Difference]: Finished difference Result 6418 states and 8907 transitions. [2021-08-30 22:45:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-30 22:45:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 0 states have call successors, (0), 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 99 [2021-08-30 22:45:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:48,928 INFO L225 Difference]: With dead ends: 6418 [2021-08-30 22:45:48,928 INFO L226 Difference]: Without dead ends: 5026 [2021-08-30 22:45:48,931 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 187 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 502.61ms TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2021-08-30 22:45:48,931 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 944 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1123.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.98ms SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1350.82ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:48,932 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [944 Valid, 0 Invalid, 1681 Unknown, 0 Unchecked, 4.98ms Time], IncrementalHoareTripleChecker [68 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1350.82ms Time] [2021-08-30 22:45:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2021-08-30 22:45:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 3032. [2021-08-30 22:45:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3031 states have (on average 1.3639063015506434) internal successors, (4134), 3031 states have internal predecessors, (4134), 0 states have call successors, (0), 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-30 22:45:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 4134 transitions. [2021-08-30 22:45:49,033 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 4134 transitions. Word has length 99 [2021-08-30 22:45:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:49,033 INFO L470 AbstractCegarLoop]: Abstraction has 3032 states and 4134 transitions. [2021-08-30 22:45:49,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 0 states have call successors, (0), 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-30 22:45:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4134 transitions. [2021-08-30 22:45:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-30 22:45:49,037 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:49,038 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 22:45:49,063 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-30 22:45:49,263 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,SelfDestructingSolverStorable15 [2021-08-30 22:45:49,263 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-30 22:45:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:49,263 INFO L82 PathProgramCache]: Analyzing trace with hash -694835630, now seen corresponding path program 1 times [2021-08-30 22:45:49,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:49,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674928721] [2021-08-30 22:45:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:49,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-30 22:45:49,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 22:45:49,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674928721] [2021-08-30 22:45:49,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674928721] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 22:45:49,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217909693] [2021-08-30 22:45:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:49,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 22:45:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 22:45:49,408 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-30 22:45:49,432 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-30 22:45:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 22:45:49,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-30 22:45:49,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 22:45:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-30 22:45:50,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 22:45:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 59 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-30 22:45:50,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217909693] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 22:45:50,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 22:45:50,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 15 [2021-08-30 22:45:50,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57125525] [2021-08-30 22:45:50,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 22:45:50,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 22:45:50,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 22:45:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-08-30 22:45:50,336 INFO L87 Difference]: Start difference. First operand 3032 states and 4134 transitions. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 0 states have call successors, (0), 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-30 22:45:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 22:45:51,817 INFO L93 Difference]: Finished difference Result 7433 states and 9812 transitions. [2021-08-30 22:45:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-30 22:45:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 0 states have call successors, (0), 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 101 [2021-08-30 22:45:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 22:45:51,830 INFO L225 Difference]: With dead ends: 7433 [2021-08-30 22:45:51,830 INFO L226 Difference]: Without dead ends: 4380 [2021-08-30 22:45:51,834 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 659.97ms TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2021-08-30 22:45:51,835 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 470 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 696.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 832.75ms IncrementalHoareTripleChecker+Time [2021-08-30 22:45:51,835 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 0 Invalid, 1053 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [61 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 832.75ms Time] [2021-08-30 22:45:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2021-08-30 22:45:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 2691. [2021-08-30 22:45:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2690 states have (on average 1.3464684014869888) internal successors, (3622), 2690 states have internal predecessors, (3622), 0 states have call successors, (0), 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-30 22:45:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3622 transitions. [2021-08-30 22:45:51,918 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3622 transitions. Word has length 101 [2021-08-30 22:45:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 22:45:51,919 INFO L470 AbstractCegarLoop]: Abstraction has 2691 states and 3622 transitions. [2021-08-30 22:45:51,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 0 states have call successors, (0), 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-30 22:45:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3622 transitions. [2021-08-30 22:45:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-30 22:45:51,923 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 22:45:51,923 INFO L513 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-30 22:45:51,929 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-30 22:45:52,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-30 22:45:52,128 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-30 22:45:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 22:45:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-08-30 22:45:52,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 22:45:52,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671822195] [2021-08-30 22:45:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 22:45:52,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 22:45:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 22:45:52,191 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 22:45:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 22:45:52,280 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 22:45:52,280 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 22:45:52,281 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-08-30 22:45:52,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-08-30 22:45:52,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-08-30 22:45:52,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-08-30 22:45:52,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-08-30 22:45:52,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-08-30 22:45:52,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-08-30 22:45:52,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-08-30 22:45:52,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-08-30 22:45:52,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-08-30 22:45:52,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-08-30 22:45:52,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-08-30 22:45:52,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-08-30 22:45:52,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-08-30 22:45:52,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-08-30 22:45:52,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-08-30 22:45:52,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-08-30 22:45:52,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-08-30 22:45:52,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-08-30 22:45:52,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-08-30 22:45:52,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-08-30 22:45:52,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-08-30 22:45:52,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-08-30 22:45:52,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-08-30 22:45:52,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-08-30 22:45:52,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-08-30 22:45:52,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-08-30 22:45:52,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-08-30 22:45:52,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-08-30 22:45:52,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-08-30 22:45:52,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-08-30 22:45:52,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-08-30 22:45:52,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-08-30 22:45:52,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-08-30 22:45:52,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-08-30 22:45:52,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-08-30 22:45:52,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-08-30 22:45:52,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-08-30 22:45:52,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-30 22:45:52,295 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 22:45:52,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 10:45:52 BoogieIcfgContainer [2021-08-30 22:45:52,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 22:45:52,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 22:45:52,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 22:45:52,380 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 22:45:52,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:45:33" (3/4) ... [2021-08-30 22:45:52,383 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-30 22:45:52,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 22:45:52,384 INFO L158 Benchmark]: Toolchain (without parser) took 19830.24ms. Allocated memory was 56.6MB in the beginning and 151.0MB in the end (delta: 94.4MB). Free memory was 35.1MB in the beginning and 99.6MB in the end (delta: -64.5MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2021-08-30 22:45:52,384 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 22:45:52,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.20ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 39.0MB in the end (delta: -4.1MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2021-08-30 22:45:52,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.02ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 37.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 22:45:52,387 INFO L158 Benchmark]: Boogie Preprocessor took 47.65ms. Allocated memory is still 56.6MB. Free memory was 37.0MB in the beginning and 35.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 22:45:52,387 INFO L158 Benchmark]: RCFGBuilder took 276.37ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.5MB in the beginning and 49.0MB in the end (delta: -13.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2021-08-30 22:45:52,388 INFO L158 Benchmark]: TraceAbstraction took 19131.13ms. Allocated memory was 69.2MB in the beginning and 151.0MB in the end (delta: 81.8MB). Free memory was 48.5MB in the beginning and 100.6MB in the end (delta: -52.1MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2021-08-30 22:45:52,388 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 151.0MB. Free memory was 100.6MB in the beginning and 99.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 22:45:52,390 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.20ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.20ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 39.0MB in the end (delta: -4.1MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.02ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 37.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.65ms. Allocated memory is still 56.6MB. Free memory was 37.0MB in the beginning and 35.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 276.37ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.5MB in the beginning and 49.0MB in the end (delta: -13.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19131.13ms. Allocated memory was 69.2MB in the beginning and 151.0MB in the end (delta: 81.8MB). Free memory was 48.5MB in the beginning and 100.6MB in the end (delta: -52.1MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 151.0MB. Free memory was 100.6MB in the beginning and 99.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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; [L117] a = __VERIFIER_nondet_uint() [L119] b = 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: 18990.04ms, OverallIterations: 18, TraceHistogramMax: 5, EmptinessCheckTime: 54.41ms, AutomataDifference: 8596.23ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 9.60ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3193 SdHoareTripleChecker+Valid, 6411.27ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3193 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 5235.51ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3578 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8231 IncrementalHoareTripleChecker+Invalid, 8638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 0 mSDtfsCounter, 8231 mSolverCounterSat, 34.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1226 GetRequests, 1062 SyntacticMatches, 18 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2207.75ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3032occurred in iteration=16, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 449.87ms AutomataMinimizationTime, 17 MinimizatonAttempts, 7994 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 89.25ms SsaConstructionTime, 1423.23ms SatisfiabilityAnalysisTime, 5810.91ms InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1980 ConstructedInterpolants, 0 QuantifiedInterpolants, 11024 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1631 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 1664/1913 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-30 22:45:52,423 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...