./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt --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 4db7127bbac4b004001641c720755d6e460ac185 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:29:45,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:29:45,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:29:45,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:29:45,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:29:45,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:29:45,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:29:45,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:29:45,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:29:45,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:29:45,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:29:45,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:29:45,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:29:45,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:29:45,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:29:45,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:29:45,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:29:45,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:29:45,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:29:45,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:29:45,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:29:45,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:29:45,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:29:45,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:29:45,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:29:45,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:29:45,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:29:45,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:29:45,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:29:45,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:29:45,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:29:45,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:29:45,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:29:45,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:29:45,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:29:45,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:29:45,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:29:45,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:29:45,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:29:45,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:29:45,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:29:45,849 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-13 00:29:45,894 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:29:45,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:29:45,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:29:45,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:29:45,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:29:45,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:29:45,904 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:29:45,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:29:45,905 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:29:45,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:29:45,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:29:45,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:29:45,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:29:45,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:29:45,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:29:45,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:29:45,907 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-13 00:29:45,908 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:29:45,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:29:45,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:29:45,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:29:45,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:29:45,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:29:45,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:29:45,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:29:45,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:29:45,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:29:45,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:29:45,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:29:45,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:29:45,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:29:45,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:29:45,913 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt 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 -> 4db7127bbac4b004001641c720755d6e460ac185 [2021-10-13 00:29:46,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:29:46,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:29:46,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:29:46,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:29:46,181 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:29:46,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2021-10-13 00:29:46,251 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/data/4b710c974/782995252e1c4901b9846021e8d123c9/FLAG493389c56 [2021-10-13 00:29:46,753 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:29:46,754 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2021-10-13 00:29:46,770 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/data/4b710c974/782995252e1c4901b9846021e8d123c9/FLAG493389c56 [2021-10-13 00:29:47,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/data/4b710c974/782995252e1c4901b9846021e8d123c9 [2021-10-13 00:29:47,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:29:47,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:29:47,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:29:47,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:29:47,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:29:47,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7c5730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47, skipping insertion in model container [2021-10-13 00:29:47,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:29:47,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:29:47,313 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c[424,437] [2021-10-13 00:29:47,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:29:47,367 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:29:47,378 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c[424,437] [2021-10-13 00:29:47,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:29:47,431 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:29:47,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47 WrapperNode [2021-10-13 00:29:47,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:29:47,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:29:47,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:29:47,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:29:47,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:29:47,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:29:47,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:29:47,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:29:47,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:29:47,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:29:47,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:29:47,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:29:47,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (1/1) ... [2021-10-13 00:29:47,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:29:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:29:47,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:29:47,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:29:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:29:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:29:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:29:47,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:29:48,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:29:48,273 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-10-13 00:29:48,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:29:48 BoogieIcfgContainer [2021-10-13 00:29:48,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:29:48,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:29:48,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:29:48,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:29:48,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:29:47" (1/3) ... [2021-10-13 00:29:48,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70740182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:29:48, skipping insertion in model container [2021-10-13 00:29:48,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:47" (2/3) ... [2021-10-13 00:29:48,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70740182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:29:48, skipping insertion in model container [2021-10-13 00:29:48,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:29:48" (3/3) ... [2021-10-13 00:29:48,296 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3.c.cil.c [2021-10-13 00:29:48,301 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:29:48,303 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2021-10-13 00:29:48,350 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:29:48,358 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 00:29:48,358 INFO L340 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2021-10-13 00:29:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 124 states have (on average 1.782258064516129) internal successors, (221), 172 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 00:29:48,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:48,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:48,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1807791520, now seen corresponding path program 1 times [2021-10-13 00:29:48,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:48,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838358311] [2021-10-13 00:29:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:48,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:48,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:48,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838358311] [2021-10-13 00:29:48,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838358311] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:48,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:48,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:29:48,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838882533] [2021-10-13 00:29:48,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 00:29:48,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:48,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 00:29:48,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:29:48,609 INFO L87 Difference]: Start difference. First operand has 173 states, 124 states have (on average 1.782258064516129) internal successors, (221), 172 states have internal predecessors, (221), 0 states have call successors, (0), 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, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:48,651 INFO L93 Difference]: Finished difference Result 324 states and 414 transitions. [2021-10-13 00:29:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 00:29:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-13 00:29:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:48,663 INFO L225 Difference]: With dead ends: 324 [2021-10-13 00:29:48,664 INFO L226 Difference]: Without dead ends: 151 [2021-10-13 00:29:48,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:29:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-10-13 00:29:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-10-13 00:29:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.6355140186915889) internal successors, (175), 150 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2021-10-13 00:29:48,725 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 7 [2021-10-13 00:29:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:48,725 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2021-10-13 00:29:48,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2021-10-13 00:29:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 00:29:48,727 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:48,727 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:48,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:29:48,728 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1806850254, now seen corresponding path program 1 times [2021-10-13 00:29:48,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:48,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148666023] [2021-10-13 00:29:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:48,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:48,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:48,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148666023] [2021-10-13 00:29:48,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148666023] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:48,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:48,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:29:48,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770601916] [2021-10-13 00:29:48,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:48,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:48,818 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,033 INFO L93 Difference]: Finished difference Result 299 states and 344 transitions. [2021-10-13 00:29:49,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-13 00:29:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,036 INFO L225 Difference]: With dead ends: 299 [2021-10-13 00:29:49,038 INFO L226 Difference]: Without dead ends: 167 [2021-10-13 00:29:49,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-13 00:29:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2021-10-13 00:29:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.575) internal successors, (189), 163 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2021-10-13 00:29:49,063 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 7 [2021-10-13 00:29:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,064 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2021-10-13 00:29:49,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2021-10-13 00:29:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 00:29:49,065 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,066 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:29:49,068 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1493296196, now seen corresponding path program 1 times [2021-10-13 00:29:49,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87079330] [2021-10-13 00:29:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:49,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87079330] [2021-10-13 00:29:49,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87079330] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:49,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065285919] [2021-10-13 00:29:49,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:49,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:49,153 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,265 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2021-10-13 00:29:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-10-13 00:29:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,269 INFO L225 Difference]: With dead ends: 253 [2021-10-13 00:29:49,269 INFO L226 Difference]: Without dead ends: 246 [2021-10-13 00:29:49,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-13 00:29:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 165. [2021-10-13 00:29:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.5158730158730158) internal successors, (191), 164 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2021-10-13 00:29:49,286 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 10 [2021-10-13 00:29:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,287 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2021-10-13 00:29:49,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2021-10-13 00:29:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 00:29:49,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,288 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:29:49,289 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 794034541, now seen corresponding path program 1 times [2021-10-13 00:29:49,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231617661] [2021-10-13 00:29:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:49,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231617661] [2021-10-13 00:29:49,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231617661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:49,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037855969] [2021-10-13 00:29:49,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:49,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,346 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,384 INFO L93 Difference]: Finished difference Result 290 states and 335 transitions. [2021-10-13 00:29:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-10-13 00:29:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,386 INFO L225 Difference]: With dead ends: 290 [2021-10-13 00:29:49,387 INFO L226 Difference]: Without dead ends: 128 [2021-10-13 00:29:49,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-10-13 00:29:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-10-13 00:29:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 127 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2021-10-13 00:29:49,397 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 10 [2021-10-13 00:29:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,398 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2021-10-13 00:29:49,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2021-10-13 00:29:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:29:49,399 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:29:49,400 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,400 INFO L82 PathProgramCache]: Analyzing trace with hash 952458318, now seen corresponding path program 1 times [2021-10-13 00:29:49,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337905672] [2021-10-13 00:29:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:49,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337905672] [2021-10-13 00:29:49,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337905672] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:29:49,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993156990] [2021-10-13 00:29:49,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:49,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:49,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,437 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,486 INFO L93 Difference]: Finished difference Result 200 states and 225 transitions. [2021-10-13 00:29:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-10-13 00:29:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,489 INFO L225 Difference]: With dead ends: 200 [2021-10-13 00:29:49,489 INFO L226 Difference]: Without dead ends: 198 [2021-10-13 00:29:49,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-13 00:29:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 126. [2021-10-13 00:29:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.5263157894736843) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2021-10-13 00:29:49,499 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 11 [2021-10-13 00:29:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,499 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2021-10-13 00:29:49,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2021-10-13 00:29:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:29:49,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,500 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:29:49,501 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 348884996, now seen corresponding path program 1 times [2021-10-13 00:29:49,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470081510] [2021-10-13 00:29:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:49,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470081510] [2021-10-13 00:29:49,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470081510] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:49,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314655239] [2021-10-13 00:29:49,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:49,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:49,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:49,583 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,680 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2021-10-13 00:29:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-13 00:29:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,691 INFO L225 Difference]: With dead ends: 207 [2021-10-13 00:29:49,691 INFO L226 Difference]: Without dead ends: 204 [2021-10-13 00:29:49,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-10-13 00:29:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 130. [2021-10-13 00:29:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 100 states have (on average 1.5) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2021-10-13 00:29:49,707 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 12 [2021-10-13 00:29:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,707 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2021-10-13 00:29:49,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2021-10-13 00:29:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:29:49,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:29:49,709 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -59736963, now seen corresponding path program 1 times [2021-10-13 00:29:49,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871288320] [2021-10-13 00:29:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:49,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871288320] [2021-10-13 00:29:49,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871288320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:49,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719264586] [2021-10-13 00:29:49,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:49,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:49,785 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-10-13 00:29:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,849 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2021-10-13 00:29:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-10-13 00:29:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,851 INFO L225 Difference]: With dead ends: 211 [2021-10-13 00:29:49,851 INFO L226 Difference]: Without dead ends: 209 [2021-10-13 00:29:49,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-13 00:29:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2021-10-13 00:29:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 132 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-10-13 00:29:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2021-10-13 00:29:49,860 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 13 [2021-10-13 00:29:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,860 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2021-10-13 00:29:49,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-10-13 00:29:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2021-10-13 00:29:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:29:49,866 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,866 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:29:49,867 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2021-10-13 00:29:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2067373522, now seen corresponding path program 1 times [2021-10-13 00:29:49,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502590097] [2021-10-13 00:29:49,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:29:49,913 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:29:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:29:49,943 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:29:49,943 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:29:49,944 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-13 00:29:49,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:29:49,961 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:29:50,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:29:50 BoogieIcfgContainer [2021-10-13 00:29:50,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:29:50,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:29:50,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:29:50,009 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:29:50,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:29:48" (3/4) ... [2021-10-13 00:29:50,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 00:29:50,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:29:50,015 INFO L168 Benchmark]: Toolchain (without parser) took 2906.88 ms. Allocated memory is still 125.8 MB. Free memory was 100.4 MB in the beginning and 93.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:50,016 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 83.9 MB. Free memory is still 43.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:29:50,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.49 ms. Allocated memory is still 125.8 MB. Free memory was 100.4 MB in the beginning and 99.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:50,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 125.8 MB. Free memory was 99.3 MB in the beginning and 96.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:50,021 INFO L168 Benchmark]: Boogie Preprocessor took 46.84 ms. Allocated memory is still 125.8 MB. Free memory was 96.2 MB in the beginning and 94.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:50,025 INFO L168 Benchmark]: RCFGBuilder took 734.53 ms. Allocated memory is still 125.8 MB. Free memory was 94.6 MB in the beginning and 73.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:50,026 INFO L168 Benchmark]: TraceAbstraction took 1728.83 ms. Allocated memory is still 125.8 MB. Free memory was 73.1 MB in the beginning and 93.4 MB in the end (delta: -20.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:29:50,028 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 125.8 MB. Free memory was 93.4 MB in the beginning and 93.1 MB in the end (delta: 301.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:29:50,034 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.28 ms. Allocated memory is still 83.9 MB. Free memory is still 43.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 324.49 ms. Allocated memory is still 125.8 MB. Free memory was 100.4 MB in the beginning and 99.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 125.8 MB. Free memory was 99.3 MB in the beginning and 96.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.84 ms. Allocated memory is still 125.8 MB. Free memory was 96.2 MB in the beginning and 94.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 734.53 ms. Allocated memory is still 125.8 MB. Free memory was 94.6 MB in the beginning and 73.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1728.83 ms. Allocated memory is still 125.8 MB. Free memory was 73.1 MB in the beginning and 93.4 MB in the end (delta: -20.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.38 ms. Allocated memory is still 125.8 MB. Free memory was 93.4 MB in the beginning and 93.1 MB in the end (delta: 301.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L218] unsigned int a ; [L219] unsigned int ma = __VERIFIER_nondet_uint(); [L220] signed char ea = __VERIFIER_nondet_char(); [L221] unsigned int b ; [L222] unsigned int mb = __VERIFIER_nondet_uint(); [L223] signed char eb = __VERIFIER_nondet_char(); [L224] unsigned int r_add1 ; [L225] unsigned int r_add2 ; [L226] unsigned int zero ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int __retres14 ; [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND TRUE ! m [L22] __retres4 = 0U [L72] return (__retres4); [L233] zero = base2flt(0, 0) [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND FALSE !(! m) [L27] COND FALSE !(m < 1U << 24U) [L49] COND TRUE 1 [L51] COND FALSE !(m >= 1U << 25U) [L68] m = m & ~ (1U << 24U) [L69] EXPR e + 128 [L69] (e + 128) << 24U - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: 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: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: 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: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: 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: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: 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: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: 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: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: 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, 173 locations, 48 error locations. Started 1 CEGAR loops. OverallTime: 1611.0ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 21.4ms, AutomataDifference: 690.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1240 SDtfs, 965 SDslu, 610 SDs, 0 SdLazy, 267 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 341.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 123.1ms AutomataMinimizationTime, 7 MinimizatonAttempts, 306 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.3ms SsaConstructionTime, 154.7ms SatisfiabilityAnalysisTime, 304.3ms InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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-10-13 00:29:50,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe0f59c1-3ab5-496f-9cc8-932120148b79/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...