./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R --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 64bit --witnessprinter.graph.data.programhash c15a5d9ed6c99b9148fde2a2ab29546ac594b5e1ca2f47e1f10c13f23b83e3df --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:50:39,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:50:39,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:50:39,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:50:39,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:50:39,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:50:39,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:50:39,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:50:39,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:50:39,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:50:39,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:50:39,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:50:39,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:50:39,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:50:39,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:50:39,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:50:39,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:50:39,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:50:39,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:50:39,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:50:39,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:50:39,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:50:39,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:50:39,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:50:39,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:50:39,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:50:39,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:50:39,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:50:39,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:50:39,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:50:39,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:50:39,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:50:39,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:50:39,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:50:39,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:50:39,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:50:39,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:50:39,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:50:39,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:50:39,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:50:39,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:50:39,931 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 17:50:39,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:50:39,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:50:39,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:50:39,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:50:39,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:50:39,984 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:50:39,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:50:39,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:50:39,985 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:50:39,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:50:39,987 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:50:39,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:50:39,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:50:39,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:50:39,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:50:39,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:50:39,989 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:50:39,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:50:39,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:50:39,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:50:39,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:50:39,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:50:39,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:50:39,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:50:39,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:50:39,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:50:39,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:50:39,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:50:39,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:50:39,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:50:39,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:50:39,993 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:50:39,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:50:39,994 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/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_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c15a5d9ed6c99b9148fde2a2ab29546ac594b5e1ca2f47e1f10c13f23b83e3df [2022-11-25 17:50:40,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:50:40,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:50:40,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:50:40,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:50:40,318 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:50:40,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i [2022-11-25 17:50:43,523 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:50:43,976 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:50:43,980 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i [2022-11-25 17:50:44,008 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/data/075eea8a7/9d05735197fc4a8e9677f85121b04bd1/FLAG907abbfc6 [2022-11-25 17:50:44,033 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/data/075eea8a7/9d05735197fc4a8e9677f85121b04bd1 [2022-11-25 17:50:44,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:50:44,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:50:44,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:50:44,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:50:44,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:50:44,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:50:44" (1/1) ... [2022-11-25 17:50:44,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b7dc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:44, skipping insertion in model container [2022-11-25 17:50:44,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:50:44" (1/1) ... [2022-11-25 17:50:44,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:50:44,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:50:44,501 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:50:45,211 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:50:45,223 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:50:45,227 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:50:45,238 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:50:45,239 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:50:45,280 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:50:45,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:50:45,305 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:50:45,345 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:50:45,405 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:50:45,407 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:50:45,408 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:50:45,411 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:50:45,412 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:50:45,417 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:50:45,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:50:45,562 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:50:45,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45 WrapperNode [2022-11-25 17:50:45,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:50:45,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:50:45,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:50:45,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:50:45,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,661 INFO L138 Inliner]: procedures = 504, calls = 63, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 59 [2022-11-25 17:50:45,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:50:45,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:50:45,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:50:45,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:50:45,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,710 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:50:45,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:50:45,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:50:45,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:50:45,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (1/1) ... [2022-11-25 17:50:45,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:50:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:50:45,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:50:45,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:50:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 17:50:45,875 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 17:50:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 17:50:45,875 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 17:50:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:50:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-25 17:50:45,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-25 17:50:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:50:45,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:50:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 17:50:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:50:46,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:50:46,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:50:46,208 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:50:46,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:50:46,221 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:50:46,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:50:46 BoogieIcfgContainer [2022-11-25 17:50:46,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:50:46,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:50:46,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:50:46,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:50:46,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:50:44" (1/3) ... [2022-11-25 17:50:46,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413db440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:50:46, skipping insertion in model container [2022-11-25 17:50:46,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:50:45" (2/3) ... [2022-11-25 17:50:46,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413db440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:50:46, skipping insertion in model container [2022-11-25 17:50:46,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:50:46" (3/3) ... [2022-11-25 17:50:46,245 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_65_good.i [2022-11-25 17:50:46,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:50:46,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 17:50:46,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:50:46,325 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4241637b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:50:46,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 17:50:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:50:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:50:46,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:46,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:46,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1141213936, now seen corresponding path program 1 times [2022-11-25 17:50:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:46,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399327337] [2022-11-25 17:50:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:46,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399327337] [2022-11-25 17:50:46,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399327337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:46,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:46,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:50:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720227539] [2022-11-25 17:50:46,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:50:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:46,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:50:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:50:46,986 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:47,103 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-11-25 17:50:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:50:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-25 17:50:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:47,116 INFO L225 Difference]: With dead ends: 66 [2022-11-25 17:50:47,116 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 17:50:47,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:50:47,123 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:47,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 205 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:50:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 17:50:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-11-25 17:50:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:50:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-11-25 17:50:47,167 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 13 [2022-11-25 17:50:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-11-25 17:50:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-11-25 17:50:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:50:47,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:47,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:47,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:50:47,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1017893737, now seen corresponding path program 1 times [2022-11-25 17:50:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:47,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788418174] [2022-11-25 17:50:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:47,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788418174] [2022-11-25 17:50:47,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788418174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:47,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:47,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:50:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440950489] [2022-11-25 17:50:47,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:47,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:50:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:47,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:50:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:50:47,245 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:47,262 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-25 17:50:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:50:47,263 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-25 17:50:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:47,264 INFO L225 Difference]: With dead ends: 46 [2022-11-25 17:50:47,264 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 17:50:47,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:50:47,266 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:47,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:50:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 17:50:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-11-25 17:50:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:50:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-11-25 17:50:47,277 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 14 [2022-11-25 17:50:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:47,277 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-11-25 17:50:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-11-25 17:50:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:50:47,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:47,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:50:47,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1017247305, now seen corresponding path program 1 times [2022-11-25 17:50:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:47,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312107422] [2022-11-25 17:50:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:47,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312107422] [2022-11-25 17:50:47,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312107422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:47,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:47,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:50:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364108196] [2022-11-25 17:50:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:47,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:50:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:50:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:50:47,345 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:47,363 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-11-25 17:50:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:50:47,364 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-25 17:50:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:47,366 INFO L225 Difference]: With dead ends: 44 [2022-11-25 17:50:47,366 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 17:50:47,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:50:47,368 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:47,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:50:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 17:50:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-11-25 17:50:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:50:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-25 17:50:47,377 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 14 [2022-11-25 17:50:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:47,377 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-25 17:50:47,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-25 17:50:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:50:47,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:47,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:47,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:50:47,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1469895454, now seen corresponding path program 1 times [2022-11-25 17:50:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:47,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242597407] [2022-11-25 17:50:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242597407] [2022-11-25 17:50:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242597407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:47,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:47,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:50:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262156205] [2022-11-25 17:50:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:47,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:50:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:47,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:50:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:50:47,461 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:47,496 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-25 17:50:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:50:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-25 17:50:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:47,499 INFO L225 Difference]: With dead ends: 43 [2022-11-25 17:50:47,499 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 17:50:47,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:50:47,501 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:47,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:50:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 17:50:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-25 17:50:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:50:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-25 17:50:47,519 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-11-25 17:50:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:47,520 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-25 17:50:47,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:50:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-25 17:50:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:50:47,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:47,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:47,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:50:47,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 52648932, now seen corresponding path program 1 times [2022-11-25 17:50:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:47,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199970465] [2022-11-25 17:50:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:50:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199970465] [2022-11-25 17:50:47,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199970465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:47,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:47,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:50:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472047027] [2022-11-25 17:50:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:47,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:50:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:47,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:50:47,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:50:47,771 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:50:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:47,876 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-25 17:50:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:50:47,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-25 17:50:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:47,878 INFO L225 Difference]: With dead ends: 47 [2022-11-25 17:50:47,880 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 17:50:47,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:50:47,882 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 28 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:47,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 120 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:50:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 17:50:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-11-25 17:50:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:50:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-25 17:50:47,902 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2022-11-25 17:50:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:47,903 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-25 17:50:47,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:50:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-25 17:50:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:50:47,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:47,905 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:47,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:50:47,906 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1419669583, now seen corresponding path program 1 times [2022-11-25 17:50:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:47,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974970989] [2022-11-25 17:50:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:50:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974970989] [2022-11-25 17:50:48,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974970989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:48,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:48,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:50:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721857410] [2022-11-25 17:50:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:50:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:50:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:50:48,089 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:50:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:48,119 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-25 17:50:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:50:48,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-25 17:50:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:48,121 INFO L225 Difference]: With dead ends: 44 [2022-11-25 17:50:48,122 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 17:50:48,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:50:48,129 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:48,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:50:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 17:50:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 17:50:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:50:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-11-25 17:50:48,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2022-11-25 17:50:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:48,147 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-11-25 17:50:48,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:50:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-11-25 17:50:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 17:50:48,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:50:48,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:48,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:50:48,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:50:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:50:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash 541608297, now seen corresponding path program 1 times [2022-11-25 17:50:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:50:48,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274497006] [2022-11-25 17:50:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:50:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:50:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:50:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 17:50:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:50:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:50:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:50:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:50:48,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274497006] [2022-11-25 17:50:48,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274497006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:50:48,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:50:48,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:50:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270739596] [2022-11-25 17:50:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:50:48,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:50:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:50:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:50:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:50:48,339 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:50:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:50:48,358 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-11-25 17:50:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:50:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-11-25 17:50:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:50:48,360 INFO L225 Difference]: With dead ends: 28 [2022-11-25 17:50:48,360 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:50:48,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:50:48,369 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:50:48,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:50:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:50:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:50:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:50:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:50:48,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-11-25 17:50:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:50:48,373 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:50:48,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:50:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:50:48,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:50:48,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 17:50:48,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 17:50:48,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 17:50:48,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 17:50:48,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:50:48,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:50:48,503 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 17:50:48,503 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point L1566(lines 1566 1570) no Hoare annotation was computed. [2022-11-25 17:50:48,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,505 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodG2B_~funcPtr~0#1.offset| |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodG2BSink.offset|) (<= |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset| |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset|) (<= |ULTIMATE.start_goodB2G_~funcPtr~1#1.base| |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.base|) (<= .cse0 0) (<= |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset| |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset|) (<= |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.base| |ULTIMATE.start_goodB2G_~funcPtr~1#1.base|))) [2022-11-25 17:50:48,505 INFO L899 garLoopResultBuilder]: For program point L1564-1(lines 1558 1565) no Hoare annotation was computed. [2022-11-25 17:50:48,505 INFO L895 garLoopResultBuilder]: At program point L1555(line 1555) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodG2B_~funcPtr~0#1.offset| |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodG2BSink.offset|) (<= .cse0 0))) [2022-11-25 17:50:48,505 INFO L899 garLoopResultBuilder]: For program point L1555-1(lines 1549 1556) no Hoare annotation was computed. [2022-11-25 17:50:48,505 INFO L895 garLoopResultBuilder]: At program point L1577(lines 1571 1578) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2)) [2022-11-25 17:50:48,506 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2)) [2022-11-25 17:50:48,506 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2022-11-25 17:50:48,506 INFO L902 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: true [2022-11-25 17:50:48,506 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-25 17:50:48,506 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (or (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~93#1|))) (and (<= |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (= |##fun~int~TO~VOID_#~93#1| |##fun~int~TO~VOID_#in~93#1|) (<= (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink_~data#1| 1) 0))) [2022-11-25 17:50:48,506 INFO L895 garLoopResultBuilder]: At program point L1594(line 1594) the Hoare annotation is: (or (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~93#1|))) (and (<= 0 (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink_~data#1| 1073741823)) (<= |#funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (= |##fun~int~TO~VOID_#~93#1| |##fun~int~TO~VOID_#in~93#1|) (<= (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink_~data#1| 1) 0))) [2022-11-25 17:50:48,507 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (or (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~93#1|))) (and (<= (+ |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_min_multiply_65b_goodG2BSink_~data#1| 1) 0) (= |##fun~int~TO~VOID_#~93#1| |##fun~int~TO~VOID_#in~93#1|) (= |##fun~int~TO~VOID_CWE191_Integer_Underflow__int_min_multiply_65b_goodG2BSink_~data#1| |##fun~int~TO~VOID_#in~93#1|))) [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,507 INFO L902 garLoopResultBuilder]: At program point ##fun~int~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point L1593(line 1593) no Hoare annotation was computed. [2022-11-25 17:50:48,507 INFO L899 garLoopResultBuilder]: For program point L1593-1(line 1593) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1599) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point L1589(lines 1589 1600) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point L1587(lines 1587 1601) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-11-25 17:50:48,508 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-25 17:50:48,509 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2022-11-25 17:50:48,509 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1586) no Hoare annotation was computed. [2022-11-25 17:50:48,512 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:50:48,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:50:48,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:50:48 BoogieIcfgContainer [2022-11-25 17:50:48,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:50:48,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:50:48,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:50:48,528 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:50:48,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:50:46" (3/4) ... [2022-11-25 17:50:48,532 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:50:48,540 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 17:50:48,540 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 17:50:48,541 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2022-11-25 17:50:48,545 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 17:50:48,545 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 17:50:48,545 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 17:50:48,546 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:50:48,584 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:50:48,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:50:48,585 INFO L158 Benchmark]: Toolchain (without parser) took 4547.77ms. Allocated memory is still 188.7MB. Free memory was 153.4MB in the beginning and 94.0MB in the end (delta: 59.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,585 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 136.3MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:50:48,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1524.82ms. Allocated memory is still 188.7MB. Free memory was 152.6MB in the beginning and 89.6MB in the end (delta: 63.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.61ms. Allocated memory is still 188.7MB. Free memory was 89.6MB in the beginning and 86.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,586 INFO L158 Benchmark]: Boogie Preprocessor took 78.35ms. Allocated memory is still 188.7MB. Free memory was 86.8MB in the beginning and 158.4MB in the end (delta: -71.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,586 INFO L158 Benchmark]: RCFGBuilder took 481.34ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 144.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,587 INFO L158 Benchmark]: TraceAbstraction took 2301.62ms. Allocated memory is still 188.7MB. Free memory was 144.8MB in the beginning and 97.1MB in the end (delta: 47.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,587 INFO L158 Benchmark]: Witness Printer took 56.37ms. Allocated memory is still 188.7MB. Free memory was 97.1MB in the beginning and 94.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:50:48,589 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.31ms. Allocated memory is still 136.3MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1524.82ms. Allocated memory is still 188.7MB. Free memory was 152.6MB in the beginning and 89.6MB in the end (delta: 63.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.61ms. Allocated memory is still 188.7MB. Free memory was 89.6MB in the beginning and 86.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.35ms. Allocated memory is still 188.7MB. Free memory was 86.8MB in the beginning and 158.4MB in the end (delta: -71.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * RCFGBuilder took 481.34ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 144.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2301.62ms. Allocated memory is still 188.7MB. Free memory was 144.8MB in the beginning and 97.1MB in the end (delta: 47.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * Witness Printer took 56.37ms. Allocated memory is still 188.7MB. Free memory was 97.1MB in the beginning and 94.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 692 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 442 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 250 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=1, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 29 PreInvPairs, 30 NumberOfFragments, 116 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 35 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9/9 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: 0 <= data + 2 RESULT: Ultimate proved your program to be correct! [2022-11-25 17:50:48,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2709dfd4-92ee-430f-927a-95134e1bced7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE