./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 22:42:50,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 22:42:50,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 22:42:50,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 22:42:50,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 22:42:50,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 22:42:50,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 22:42:50,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 22:42:50,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 22:42:50,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 22:42:50,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 22:42:50,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 22:42:50,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 22:42:50,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 22:42:50,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 22:42:50,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 22:42:50,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 22:42:50,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 22:42:50,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 22:42:50,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 22:42:50,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 22:42:50,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 22:42:50,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 22:42:50,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 22:42:50,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 22:42:50,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 22:42:50,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 22:42:50,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 22:42:50,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 22:42:50,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 22:42:50,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 22:42:50,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 22:42:50,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 22:42:50,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 22:42:50,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 22:42:50,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 22:42:50,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 22:42:50,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 22:42:50,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 22:42:50,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 22:42:50,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 22:42:50,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-14 22:42:50,931 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 22:42:50,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 22:42:50,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 22:42:50,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 22:42:50,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 22:42:50,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 22:42:50,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 22:42:50,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 22:42:50,934 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 22:42:50,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 22:42:50,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 22:42:50,935 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 22:42:50,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 22:42:50,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 22:42:50,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 22:42:50,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 22:42:50,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 22:42:50,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 22:42:50,936 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-14 22:42:50,936 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 22:42:50,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 22:42:50,936 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 22:42:50,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 22:42:50,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 22:42:50,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 22:42:50,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 22:42:50,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 22:42:50,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 22:42:50,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 22:42:50,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 22:42:50,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 22:42:50,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 22:42:50,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 22:42:50,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 22:42:50,939 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2021-12-14 22:42:51,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 22:42:51,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 22:42:51,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 22:42:51,126 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 22:42:51,127 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 22:42:51,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-12-14 22:42:51,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4798b85d6/d75245c90ab240309d914d7fe6772a19/FLAG41f824ef5 [2021-12-14 22:42:51,570 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 22:42:51,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-12-14 22:42:51,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4798b85d6/d75245c90ab240309d914d7fe6772a19/FLAG41f824ef5 [2021-12-14 22:42:51,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4798b85d6/d75245c90ab240309d914d7fe6772a19 [2021-12-14 22:42:51,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 22:42:51,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 22:42:51,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 22:42:51,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 22:42:51,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 22:42:51,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37004b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51, skipping insertion in model container [2021-12-14 22:42:51,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 22:42:51,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 22:42:51,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2021-12-14 22:42:51,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 22:42:51,774 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 22:42:51,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2021-12-14 22:42:51,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 22:42:51,808 INFO L208 MainTranslator]: Completed translation [2021-12-14 22:42:51,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51 WrapperNode [2021-12-14 22:42:51,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 22:42:51,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 22:42:51,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 22:42:51,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 22:42:51,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,859 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-12-14 22:42:51,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 22:42:51,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 22:42:51,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 22:42:51,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 22:42:51,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 22:42:51,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 22:42:51,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 22:42:51,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 22:42:51,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (1/1) ... [2021-12-14 22:42:51,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 22:42:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:51,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 22:42:51,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 22:42:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 22:42:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 22:42:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 22:42:51,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 22:42:52,007 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 22:42:52,008 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 22:42:52,183 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 22:42:52,188 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 22:42:52,188 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 22:42:52,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:42:52 BoogieIcfgContainer [2021-12-14 22:42:52,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 22:42:52,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 22:42:52,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 22:42:52,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 22:42:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:42:51" (1/3) ... [2021-12-14 22:42:52,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618fe45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:42:52, skipping insertion in model container [2021-12-14 22:42:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:42:51" (2/3) ... [2021-12-14 22:42:52,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618fe45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:42:52, skipping insertion in model container [2021-12-14 22:42:52,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:42:52" (3/3) ... [2021-12-14 22:42:52,196 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2021-12-14 22:42:52,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 22:42:52,200 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-14 22:42:52,231 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 22:42:52,236 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 22:42:52,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-14 22:42:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 22:42:52,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:52,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 22:42:52,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-14 22:42:52,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:52,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65100727] [2021-12-14 22:42:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:52,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:52,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65100727] [2021-12-14 22:42:52,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65100727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:52,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:52,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-14 22:42:52,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427721204] [2021-12-14 22:42:52,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:52,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 22:42:52,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 22:42:52,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 22:42:52,442 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:52,460 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-14 22:42:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 22:42:52,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-14 22:42:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:52,467 INFO L225 Difference]: With dead ends: 135 [2021-12-14 22:42:52,467 INFO L226 Difference]: Without dead ends: 69 [2021-12-14 22:42:52,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 22:42:52,471 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:52,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-14 22:42:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-14 22:42:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-14 22:42:52,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-14 22:42:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:52,496 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-14 22:42:52,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-14 22:42:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 22:42:52,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:52,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:52,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 22:42:52,498 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:52,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-14 22:42:52,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:52,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073890974] [2021-12-14 22:42:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:52,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:52,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073890974] [2021-12-14 22:42:52,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073890974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:52,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:52,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:42:52,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833747045] [2021-12-14 22:42:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:52,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:52,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:52,587 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:52,679 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-14 22:42:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 22:42:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:52,680 INFO L225 Difference]: With dead ends: 145 [2021-12-14 22:42:52,680 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 22:42:52,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:52,681 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:52,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 22:42:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-14 22:42:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-14 22:42:52,690 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-14 22:42:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:52,691 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-14 22:42:52,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-14 22:42:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 22:42:52,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:52,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:52,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 22:42:52,694 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-14 22:42:52,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430517462] [2021-12-14 22:42:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:52,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:52,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:52,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430517462] [2021-12-14 22:42:52,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430517462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:52,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:52,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:42:52,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526325633] [2021-12-14 22:42:52,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:52,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:52,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:52,776 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:52,925 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-12-14 22:42:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 22:42:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:52,931 INFO L225 Difference]: With dead ends: 221 [2021-12-14 22:42:52,932 INFO L226 Difference]: Without dead ends: 164 [2021-12-14 22:42:52,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:42:52,938 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:52,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 281 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-14 22:42:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-12-14 22:42:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-12-14 22:42:52,966 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-12-14 22:42:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:52,966 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-12-14 22:42:52,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-12-14 22:42:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 22:42:52,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:52,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:52,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 22:42:52,968 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-12-14 22:42:52,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:52,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300122034] [2021-12-14 22:42:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:52,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:53,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300122034] [2021-12-14 22:42:53,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300122034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:53,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:53,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:42:53,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679766049] [2021-12-14 22:42:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:53,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:53,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:53,065 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:53,188 INFO L93 Difference]: Finished difference Result 259 states and 340 transitions. [2021-12-14 22:42:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:53,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 22:42:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:53,190 INFO L225 Difference]: With dead ends: 259 [2021-12-14 22:42:53,190 INFO L226 Difference]: Without dead ends: 194 [2021-12-14 22:42:53,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:42:53,198 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:53,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 291 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-14 22:42:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2021-12-14 22:42:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2021-12-14 22:42:53,225 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2021-12-14 22:42:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:53,226 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2021-12-14 22:42:53,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2021-12-14 22:42:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 22:42:53,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:53,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:53,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 22:42:53,228 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2021-12-14 22:42:53,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:53,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001058698] [2021-12-14 22:42:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:53,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:53,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:53,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001058698] [2021-12-14 22:42:53,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001058698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:53,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:53,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:42:53,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79958792] [2021-12-14 22:42:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:53,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:53,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:53,297 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:53,302 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2021-12-14 22:42:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:53,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 22:42:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:53,303 INFO L225 Difference]: With dead ends: 192 [2021-12-14 22:42:53,303 INFO L226 Difference]: Without dead ends: 91 [2021-12-14 22:42:53,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:53,304 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:53,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-14 22:42:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-14 22:42:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2021-12-14 22:42:53,307 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 26 [2021-12-14 22:42:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:53,307 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2021-12-14 22:42:53,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2021-12-14 22:42:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 22:42:53,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:53,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:53,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 22:42:53,308 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1291653624, now seen corresponding path program 1 times [2021-12-14 22:42:53,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:53,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700202324] [2021-12-14 22:42:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:53,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:53,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700202324] [2021-12-14 22:42:53,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700202324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:53,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:53,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:42:53,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987722494] [2021-12-14 22:42:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:53,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:53,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:53,348 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:53,366 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2021-12-14 22:42:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:53,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 22:42:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:53,367 INFO L225 Difference]: With dead ends: 115 [2021-12-14 22:42:53,367 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 22:42:53,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:53,368 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:53,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 22:42:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-14 22:42:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2021-12-14 22:42:53,372 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 32 [2021-12-14 22:42:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:53,372 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-12-14 22:42:53,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2021-12-14 22:42:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 22:42:53,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:53,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:53,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 22:42:53,374 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 280536374, now seen corresponding path program 1 times [2021-12-14 22:42:53,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947522464] [2021-12-14 22:42:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:53,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:53,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947522464] [2021-12-14 22:42:53,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947522464] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757892456] [2021-12-14 22:42:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:53,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:53,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:42:53,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 22:42:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:53,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 22:42:53,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:53,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:53,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757892456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:53,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:53,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-14 22:42:53,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286744928] [2021-12-14 22:42:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:53,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:53,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:53,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:53,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:42:53,623 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:53,751 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2021-12-14 22:42:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:53,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 22:42:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:53,753 INFO L225 Difference]: With dead ends: 218 [2021-12-14 22:42:53,753 INFO L226 Difference]: Without dead ends: 164 [2021-12-14 22:42:53,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:42:53,756 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:53,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-14 22:42:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2021-12-14 22:42:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.25) internal successors, (170), 136 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-12-14 22:42:53,772 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 32 [2021-12-14 22:42:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:53,773 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-12-14 22:42:53,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-12-14 22:42:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 22:42:53,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:53,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:53,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 22:42:53,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:53,995 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1198830924, now seen corresponding path program 1 times [2021-12-14 22:42:53,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:53,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357382580] [2021-12-14 22:42:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:53,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:42:54,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:54,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357382580] [2021-12-14 22:42:54,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357382580] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:54,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524170321] [2021-12-14 22:42:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:54,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:54,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:54,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:42:54,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 22:42:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 22:42:54,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:54,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:54,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524170321] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:54,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:54,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 22:42:54,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561773112] [2021-12-14 22:42:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:54,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:54,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:54,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:54,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:54,254 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:54,381 INFO L93 Difference]: Finished difference Result 315 states and 423 transitions. [2021-12-14 22:42:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 22:42:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:54,382 INFO L225 Difference]: With dead ends: 315 [2021-12-14 22:42:54,382 INFO L226 Difference]: Without dead ends: 205 [2021-12-14 22:42:54,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:54,383 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:54,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-14 22:42:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 169. [2021-12-14 22:42:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2261904761904763) internal successors, (206), 168 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-12-14 22:42:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2021-12-14 22:42:54,391 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 39 [2021-12-14 22:42:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:54,391 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2021-12-14 22:42:54,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2021-12-14 22:42:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 22:42:54,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:54,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:54,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:54,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 22:42:54,604 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2073059654, now seen corresponding path program 1 times [2021-12-14 22:42:54,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013233450] [2021-12-14 22:42:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:54,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 22:42:54,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:54,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013233450] [2021-12-14 22:42:54,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013233450] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:54,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803073636] [2021-12-14 22:42:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:54,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:54,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:54,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:42:54,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 22:42:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:54,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 22:42:54,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 22:42:54,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:54,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803073636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:54,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:54,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 22:42:54,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693441869] [2021-12-14 22:42:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:54,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:54,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:54,821 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:54,920 INFO L93 Difference]: Finished difference Result 380 states and 494 transitions. [2021-12-14 22:42:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:54,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-14 22:42:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:54,921 INFO L225 Difference]: With dead ends: 380 [2021-12-14 22:42:54,921 INFO L226 Difference]: Without dead ends: 238 [2021-12-14 22:42:54,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:54,922 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:54,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-14 22:42:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 201. [2021-12-14 22:42:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.21) internal successors, (242), 200 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 242 transitions. [2021-12-14 22:42:54,926 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 242 transitions. Word has length 46 [2021-12-14 22:42:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:54,927 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 242 transitions. [2021-12-14 22:42:54,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 242 transitions. [2021-12-14 22:42:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-14 22:42:54,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:54,927 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:54,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 22:42:55,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:55,135 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1645599792, now seen corresponding path program 1 times [2021-12-14 22:42:55,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933884844] [2021-12-14 22:42:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:42:55,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933884844] [2021-12-14 22:42:55,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933884844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:55,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 22:42:55,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629476872] [2021-12-14 22:42:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:42:55,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:42:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:55,172 INFO L87 Difference]: Start difference. First operand 201 states and 242 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,177 INFO L93 Difference]: Finished difference Result 238 states and 283 transitions. [2021-12-14 22:42:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:42:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-12-14 22:42:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,179 INFO L225 Difference]: With dead ends: 238 [2021-12-14 22:42:55,179 INFO L226 Difference]: Without dead ends: 177 [2021-12-14 22:42:55,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:42:55,179 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-14 22:42:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2021-12-14 22:42:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 155 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2021-12-14 22:42:55,184 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 53 [2021-12-14 22:42:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,185 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2021-12-14 22:42:55,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2021-12-14 22:42:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 22:42:55,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,186 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 22:42:55,186 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 255895067, now seen corresponding path program 1 times [2021-12-14 22:42:55,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733558570] [2021-12-14 22:42:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 22:42:55,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733558570] [2021-12-14 22:42:55,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733558570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:42:55,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:42:55,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939763697] [2021-12-14 22:42:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:42:55,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:42:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:55,220 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,251 INFO L93 Difference]: Finished difference Result 408 states and 498 transitions. [2021-12-14 22:42:55,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:42:55,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-14 22:42:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,252 INFO L225 Difference]: With dead ends: 408 [2021-12-14 22:42:55,252 INFO L226 Difference]: Without dead ends: 279 [2021-12-14 22:42:55,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:42:55,253 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 55 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:42:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-14 22:42:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 197. [2021-12-14 22:42:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.260204081632653) internal successors, (247), 196 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2021-12-14 22:42:55,258 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 62 [2021-12-14 22:42:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,258 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2021-12-14 22:42:55,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2021-12-14 22:42:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 22:42:55,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,259 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 22:42:55,259 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1988088231, now seen corresponding path program 2 times [2021-12-14 22:42:55,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532405408] [2021-12-14 22:42:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:42:55,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532405408] [2021-12-14 22:42:55,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532405408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:55,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481347754] [2021-12-14 22:42:55,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 22:42:55,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:55,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:42:55,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 22:42:55,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 22:42:55,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 22:42:55,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 22:42:55,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-14 22:42:55,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:42:55,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481347754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:42:55,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:42:55,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-14 22:42:55,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311017129] [2021-12-14 22:42:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:42:55,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:42:55,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:42:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:55,452 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:55,546 INFO L93 Difference]: Finished difference Result 711 states and 902 transitions. [2021-12-14 22:42:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 22:42:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-14 22:42:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:55,548 INFO L225 Difference]: With dead ends: 711 [2021-12-14 22:42:55,548 INFO L226 Difference]: Without dead ends: 541 [2021-12-14 22:42:55,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 22:42:55,549 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 144 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:55,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 460 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-12-14 22:42:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 358. [2021-12-14 22:42:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.2717086834733893) internal successors, (454), 357 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 454 transitions. [2021-12-14 22:42:55,556 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 454 transitions. Word has length 62 [2021-12-14 22:42:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:55,556 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 454 transitions. [2021-12-14 22:42:55,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 454 transitions. [2021-12-14 22:42:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 22:42:55,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:55,557 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:55,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:55,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:55,773 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1745436811, now seen corresponding path program 1 times [2021-12-14 22:42:55,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:55,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217580483] [2021-12-14 22:42:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:42:55,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217580483] [2021-12-14 22:42:55,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217580483] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857280762] [2021-12-14 22:42:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:55,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:55,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:42:55,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 22:42:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:55,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 22:42:55,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:42:56,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:42:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 22:42:56,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857280762] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:42:56,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:42:56,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 7 [2021-12-14 22:42:56,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798243166] [2021-12-14 22:42:56,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:42:56,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 22:42:56,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:42:56,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 22:42:56,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:42:56,199 INFO L87 Difference]: Start difference. First operand 358 states and 454 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:42:56,338 INFO L93 Difference]: Finished difference Result 872 states and 1104 transitions. [2021-12-14 22:42:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:42:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-14 22:42:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:42:56,339 INFO L225 Difference]: With dead ends: 872 [2021-12-14 22:42:56,340 INFO L226 Difference]: Without dead ends: 545 [2021-12-14 22:42:56,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 22:42:56,340 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 197 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:42:56,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 175 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:42:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-12-14 22:42:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 366. [2021-12-14 22:42:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.2657534246575342) internal successors, (462), 365 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 462 transitions. [2021-12-14 22:42:56,349 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 462 transitions. Word has length 65 [2021-12-14 22:42:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:42:56,349 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 462 transitions. [2021-12-14 22:42:56,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:42:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 462 transitions. [2021-12-14 22:42:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 22:42:56,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:42:56,349 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:42:56,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 22:42:56,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 22:42:56,563 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:42:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:42:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash -392959527, now seen corresponding path program 1 times [2021-12-14 22:42:56,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:42:56,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387524221] [2021-12-14 22:42:56,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:56,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:42:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:42:56,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:42:56,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387524221] [2021-12-14 22:42:56,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387524221] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:42:56,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919337807] [2021-12-14 22:42:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:42:56,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:42:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:42:56,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:42:56,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 22:42:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:42:56,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 22:42:56,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:42:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:42:56,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:43:04,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919337807] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:04,264 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:04,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2021-12-14 22:43:04,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474075490] [2021-12-14 22:43:04,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:04,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 22:43:04,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 22:43:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=36, Unknown=2, NotChecked=0, Total=56 [2021-12-14 22:43:04,265 INFO L87 Difference]: Start difference. First operand 366 states and 462 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:04,495 INFO L93 Difference]: Finished difference Result 1458 states and 1853 transitions. [2021-12-14 22:43:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 22:43:04,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-14 22:43:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:04,499 INFO L225 Difference]: With dead ends: 1458 [2021-12-14 22:43:04,499 INFO L226 Difference]: Without dead ends: 1091 [2021-12-14 22:43:04,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=46, Invalid=84, Unknown=2, NotChecked=0, Total=132 [2021-12-14 22:43:04,500 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 291 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:04,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 231 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2021-12-14 22:43:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-14 22:43:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 905. [2021-12-14 22:43:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 1.2577433628318584) internal successors, (1137), 904 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1137 transitions. [2021-12-14 22:43:04,517 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1137 transitions. Word has length 71 [2021-12-14 22:43:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:04,518 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1137 transitions. [2021-12-14 22:43:04,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1137 transitions. [2021-12-14 22:43:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 22:43:04,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:04,520 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:04,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:04,739 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-12-14 22:43:04,739 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:04,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1149725251, now seen corresponding path program 1 times [2021-12-14 22:43:04,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:04,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449449950] [2021-12-14 22:43:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:04,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 22:43:04,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449449950] [2021-12-14 22:43:04,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449449950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:04,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:04,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 22:43:04,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437537279] [2021-12-14 22:43:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:04,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 22:43:04,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 22:43:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:04,808 INFO L87 Difference]: Start difference. First operand 905 states and 1137 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:05,073 INFO L93 Difference]: Finished difference Result 2528 states and 3161 transitions. [2021-12-14 22:43:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:43:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-14 22:43:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:05,077 INFO L225 Difference]: With dead ends: 2528 [2021-12-14 22:43:05,077 INFO L226 Difference]: Without dead ends: 1435 [2021-12-14 22:43:05,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-14 22:43:05,079 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 160 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:05,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 217 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 22:43:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2021-12-14 22:43:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1012. [2021-12-14 22:43:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2700296735905046) internal successors, (1284), 1011 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1284 transitions. [2021-12-14 22:43:05,099 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1284 transitions. Word has length 71 [2021-12-14 22:43:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:05,099 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1284 transitions. [2021-12-14 22:43:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1284 transitions. [2021-12-14 22:43:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 22:43:05,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:05,103 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:05,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 22:43:05,103 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:05,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1488348929, now seen corresponding path program 1 times [2021-12-14 22:43:05,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:05,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661594675] [2021-12-14 22:43:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:05,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 22:43:05,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:05,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661594675] [2021-12-14 22:43:05,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661594675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:05,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:05,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 22:43:05,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361965402] [2021-12-14 22:43:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:05,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 22:43:05,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 22:43:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:05,193 INFO L87 Difference]: Start difference. First operand 1012 states and 1284 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:05,632 INFO L93 Difference]: Finished difference Result 2527 states and 3176 transitions. [2021-12-14 22:43:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 22:43:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-12-14 22:43:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:05,636 INFO L225 Difference]: With dead ends: 2527 [2021-12-14 22:43:05,636 INFO L226 Difference]: Without dead ends: 1412 [2021-12-14 22:43:05,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:05,638 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 195 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:05,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 304 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 22:43:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2021-12-14 22:43:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1082. [2021-12-14 22:43:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.274745605920444) internal successors, (1378), 1081 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1378 transitions. [2021-12-14 22:43:05,670 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1378 transitions. Word has length 77 [2021-12-14 22:43:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:05,670 INFO L470 AbstractCegarLoop]: Abstraction has 1082 states and 1378 transitions. [2021-12-14 22:43:05,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1378 transitions. [2021-12-14 22:43:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 22:43:05,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:05,672 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:05,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 22:43:05,672 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash -529637703, now seen corresponding path program 1 times [2021-12-14 22:43:05,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:05,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375492455] [2021-12-14 22:43:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:05,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 22:43:05,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375492455] [2021-12-14 22:43:05,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375492455] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710187207] [2021-12-14 22:43:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:05,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:05,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:05,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:05,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 22:43:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:05,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 22:43:05,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 22:43:05,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 22:43:06,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710187207] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:06,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:06,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2021-12-14 22:43:06,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660666705] [2021-12-14 22:43:06,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:06,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 22:43:06,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 22:43:06,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-14 22:43:06,077 INFO L87 Difference]: Start difference. First operand 1082 states and 1378 transitions. Second operand has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:07,545 INFO L93 Difference]: Finished difference Result 6182 states and 7507 transitions. [2021-12-14 22:43:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-14 22:43:07,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-12-14 22:43:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:07,559 INFO L225 Difference]: With dead ends: 6182 [2021-12-14 22:43:07,559 INFO L226 Difference]: Without dead ends: 6109 [2021-12-14 22:43:07,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 22:43:07,561 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 655 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:07,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 792 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 22:43:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2021-12-14 22:43:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 1604. [2021-12-14 22:43:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.4036182158452901) internal successors, (2250), 1603 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2250 transitions. [2021-12-14 22:43:07,618 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2250 transitions. Word has length 77 [2021-12-14 22:43:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:07,618 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2250 transitions. [2021-12-14 22:43:07,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2250 transitions. [2021-12-14 22:43:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:07,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:07,620 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:07,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:07,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:07,837 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash -705708941, now seen corresponding path program 1 times [2021-12-14 22:43:07,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:07,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512908168] [2021-12-14 22:43:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:07,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 22:43:07,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:07,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512908168] [2021-12-14 22:43:07,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512908168] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737053046] [2021-12-14 22:43:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:07,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:07,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:07,934 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:07,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 22:43:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:08,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 22:43:08,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 22:43:08,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:43:08,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737053046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:08,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:43:08,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-12-14 22:43:08,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490259937] [2021-12-14 22:43:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:08,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:08,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 22:43:08,186 INFO L87 Difference]: Start difference. First operand 1604 states and 2250 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:08,303 INFO L93 Difference]: Finished difference Result 4188 states and 5649 transitions. [2021-12-14 22:43:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 22:43:08,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:08,309 INFO L225 Difference]: With dead ends: 4188 [2021-12-14 22:43:08,310 INFO L226 Difference]: Without dead ends: 2615 [2021-12-14 22:43:08,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:08,312 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 193 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:08,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 275 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2021-12-14 22:43:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1936. [2021-12-14 22:43:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1935 states have (on average 1.3074935400516796) internal successors, (2530), 1935 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2530 transitions. [2021-12-14 22:43:08,350 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2530 transitions. Word has length 83 [2021-12-14 22:43:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:08,351 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2530 transitions. [2021-12-14 22:43:08,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2530 transitions. [2021-12-14 22:43:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:08,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:08,353 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:08,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 22:43:08,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 22:43:08,570 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1924468269, now seen corresponding path program 1 times [2021-12-14 22:43:08,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:08,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222979830] [2021-12-14 22:43:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:08,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:43:08,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:08,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222979830] [2021-12-14 22:43:08,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222979830] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:08,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878357552] [2021-12-14 22:43:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:08,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:08,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:08,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:08,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 22:43:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:08,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 22:43:08,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:43:09,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 22:43:09,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878357552] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:09,815 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:09,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-12-14 22:43:09,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413787936] [2021-12-14 22:43:09,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:09,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 22:43:09,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 22:43:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-14 22:43:09,816 INFO L87 Difference]: Start difference. First operand 1936 states and 2530 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-12-14 22:43:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:11,208 INFO L93 Difference]: Finished difference Result 8517 states and 10279 transitions. [2021-12-14 22:43:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 22:43:11,209 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-12-14 22:43:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:11,224 INFO L225 Difference]: With dead ends: 8517 [2021-12-14 22:43:11,225 INFO L226 Difference]: Without dead ends: 7316 [2021-12-14 22:43:11,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 22:43:11,228 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 1089 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:11,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1089 Valid, 1709 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 22:43:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2021-12-14 22:43:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 1658. [2021-12-14 22:43:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.2933011466505733) internal successors, (2143), 1657 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2143 transitions. [2021-12-14 22:43:11,301 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2143 transitions. Word has length 83 [2021-12-14 22:43:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:11,301 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 2143 transitions. [2021-12-14 22:43:11,301 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-12-14 22:43:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2143 transitions. [2021-12-14 22:43:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 22:43:11,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:11,303 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:11,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 22:43:11,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:11,520 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1508814206, now seen corresponding path program 1 times [2021-12-14 22:43:11,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:11,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600770138] [2021-12-14 22:43:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:11,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 22:43:11,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:11,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600770138] [2021-12-14 22:43:11,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600770138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:11,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649455213] [2021-12-14 22:43:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:11,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:11,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:11,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:11,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 22:43:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:11,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 22:43:11,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-14 22:43:11,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-14 22:43:12,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649455213] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:12,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:12,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-14 22:43:12,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828317057] [2021-12-14 22:43:12,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:12,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 22:43:12,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 22:43:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:12,055 INFO L87 Difference]: Start difference. First operand 1658 states and 2143 transitions. Second operand has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:12,241 INFO L93 Difference]: Finished difference Result 2883 states and 3806 transitions. [2021-12-14 22:43:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 22:43:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-14 22:43:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:12,244 INFO L225 Difference]: With dead ends: 2883 [2021-12-14 22:43:12,244 INFO L226 Difference]: Without dead ends: 1058 [2021-12-14 22:43:12,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2021-12-14 22:43:12,246 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 372 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:12,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 131 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2021-12-14 22:43:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 509. [2021-12-14 22:43:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.2165354330708662) internal successors, (618), 508 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 618 transitions. [2021-12-14 22:43:12,258 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 618 transitions. Word has length 83 [2021-12-14 22:43:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:12,258 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 618 transitions. [2021-12-14 22:43:12,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 618 transitions. [2021-12-14 22:43:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 22:43:12,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:12,259 INFO L514 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] [2021-12-14 22:43:12,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:12,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:12,483 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:12,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1081425873, now seen corresponding path program 1 times [2021-12-14 22:43:12,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:12,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374592106] [2021-12-14 22:43:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:12,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-14 22:43:12,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374592106] [2021-12-14 22:43:12,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374592106] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733062426] [2021-12-14 22:43:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:12,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:12,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:12,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 22:43:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:12,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 22:43:12,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 22:43:12,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-14 22:43:13,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733062426] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:13,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:13,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-14 22:43:13,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369014920] [2021-12-14 22:43:13,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:13,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 22:43:13,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 22:43:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:13,144 INFO L87 Difference]: Start difference. First operand 509 states and 618 transitions. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:13,494 INFO L93 Difference]: Finished difference Result 1580 states and 1908 transitions. [2021-12-14 22:43:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 22:43:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 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) Word has length 93 [2021-12-14 22:43:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:13,496 INFO L225 Difference]: With dead ends: 1580 [2021-12-14 22:43:13,496 INFO L226 Difference]: Without dead ends: 1088 [2021-12-14 22:43:13,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-14 22:43:13,497 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 389 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:13,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 268 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 22:43:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-12-14 22:43:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 899. [2021-12-14 22:43:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.2260579064587973) internal successors, (1101), 898 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1101 transitions. [2021-12-14 22:43:13,516 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1101 transitions. Word has length 93 [2021-12-14 22:43:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:13,516 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1101 transitions. [2021-12-14 22:43:13,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1101 transitions. [2021-12-14 22:43:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-14 22:43:13,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:13,517 INFO L514 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-12-14 22:43:13,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:13,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 22:43:13,731 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1639126430, now seen corresponding path program 1 times [2021-12-14 22:43:13,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:13,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760978000] [2021-12-14 22:43:13,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:13,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-14 22:43:13,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:13,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760978000] [2021-12-14 22:43:13,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760978000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:13,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765901342] [2021-12-14 22:43:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:13,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:13,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:13,854 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:13,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 22:43:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:14,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 22:43:14,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-14 22:43:14,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 66 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-14 22:43:14,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765901342] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:14,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:14,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2021-12-14 22:43:14,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442995733] [2021-12-14 22:43:14,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:14,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 22:43:14,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 22:43:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-12-14 22:43:14,497 INFO L87 Difference]: Start difference. First operand 899 states and 1101 transitions. Second operand has 18 states, 18 states have (on average 8.944444444444445) internal successors, (161), 18 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:18,029 INFO L93 Difference]: Finished difference Result 2381 states and 2834 transitions. [2021-12-14 22:43:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-12-14 22:43:18,031 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.944444444444445) internal successors, (161), 18 states have internal predecessors, (161), 0 states have call successors, (0), 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-12-14 22:43:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:18,034 INFO L225 Difference]: With dead ends: 2381 [2021-12-14 22:43:18,034 INFO L226 Difference]: Without dead ends: 1121 [2021-12-14 22:43:18,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1535, Invalid=7021, Unknown=0, NotChecked=0, Total=8556 [2021-12-14 22:43:18,036 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 2435 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:18,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2435 Valid, 748 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-14 22:43:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-12-14 22:43:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 575. [2021-12-14 22:43:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 1.2613240418118468) internal successors, (724), 574 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 724 transitions. [2021-12-14 22:43:18,050 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 724 transitions. Word has length 99 [2021-12-14 22:43:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:18,050 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 724 transitions. [2021-12-14 22:43:18,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.944444444444445) internal successors, (161), 18 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 724 transitions. [2021-12-14 22:43:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-14 22:43:18,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:18,051 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:18,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:18,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 22:43:18,256 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-14 22:43:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-12-14 22:43:18,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:18,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051839836] [2021-12-14 22:43:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:18,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 22:43:18,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 22:43:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 22:43:18,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 22:43:18,350 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 22:43:18,350 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-14 22:43:18,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-14 22:43:18,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-14 22:43:18,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-14 22:43:18,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-14 22:43:18,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-14 22:43:18,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-14 22:43:18,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-14 22:43:18,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-14 22:43:18,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-14 22:43:18,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-14 22:43:18,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-14 22:43:18,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-14 22:43:18,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-14 22:43:18,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 22:43:18,359 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:18,361 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 22:43:18,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:43:18 BoogieIcfgContainer [2021-12-14 22:43:18,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 22:43:18,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 22:43:18,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 22:43:18,446 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 22:43:18,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:42:52" (3/4) ... [2021-12-14 22:43:18,448 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 22:43:18,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 22:43:18,449 INFO L158 Benchmark]: Toolchain (without parser) took 26862.24ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 69.9MB in the beginning and 62.7MB in the end (delta: 7.2MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2021-12-14 22:43:18,449 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 22:43:18,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.43ms. Allocated memory is still 100.7MB. Free memory was 69.9MB in the beginning and 75.6MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 22:43:18,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.85ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 22:43:18,452 INFO L158 Benchmark]: Boogie Preprocessor took 16.41ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 71.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 22:43:18,453 INFO L158 Benchmark]: RCFGBuilder took 312.97ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 57.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 22:43:18,453 INFO L158 Benchmark]: TraceAbstraction took 26253.94ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 57.3MB in the beginning and 63.7MB in the end (delta: -6.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2021-12-14 22:43:18,453 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 127.9MB. Free memory was 63.7MB in the beginning and 62.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 22:43:18,459 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.43ms. Allocated memory is still 100.7MB. Free memory was 69.9MB in the beginning and 75.6MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.85ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.41ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 71.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.97ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 57.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26253.94ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 57.3MB in the beginning and 63.7MB in the end (delta: -6.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 127.9MB. Free memory was 63.7MB in the beginning and 62.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=0, na=4, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=4043440128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=4043440128] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4043440128] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=4043440128] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=4043440128] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=4043440128] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=4043440128] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=4043440128] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=4043440128] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4043440128] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4043440128] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4043440128] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, r0=4043440128] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, r0=4043440128] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4043440128, r1=4043440129] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4043440128, r1=4043440129] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, r0=4043440128, r1=4043440129] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, r0=4043440128, r1=4043440129] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, r0=4043440128, r1=4043440129] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129, r2=4043440130] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129, r2=4043440130] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=1, i=3, na=4, nb=4, partial_sum=2, r0=4043440128, r1=4043440129, r2=4043440130] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4043440128, r1=4043440129, r2=4043440130] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=4043440128, r1=4043440129, r2=4043440130] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=4043440128, r1=4043440129, r2=4043440130] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=4043440128, r1=4043440129, r2=4043440130] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=4043440128, r1=4043440129, r2=4043440130] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=4043440128, r1=4043440129, r2=4043440130] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=4043440128, r1=4043440129, r2=4043440130] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=4043440127, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4043440127, b0=4043440127, b1=15794687, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4043440128, r1=4043440129, r2=4043440130, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6678 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6678 mSDsluCounter, 7250 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 66 IncrementalHoareTripleChecker+Unchecked, 5103 mSDsCounter, 883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5746 IncrementalHoareTripleChecker+Invalid, 6695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 883 mSolverCounterUnsat, 2147 mSDtfsCounter, 5746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1703 GetRequests, 1416 SyntacticMatches, 12 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1936occurred in iteration=18, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 13768 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2148 NumberOfCodeBlocks, 2148 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2577 ConstructedInterpolants, 6 QuantifiedInterpolants, 10544 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1959 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 41 InterpolantComputations, 15 PerfectInterpolantSequences, 2185/2481 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 22:43:18,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample