./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_44_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/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_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_44_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/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_af592b9d-843a-45c0-bcd4-a13dd334b4c0/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 4749945598aad49392ff7e08572aefcd51483347614bf2f6111264a526d0d26d --- 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 16:45:13,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:45:13,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:45:13,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:45:13,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:45:13,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:45:13,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:45:13,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:45:13,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:45:13,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:45:13,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:45:13,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:45:13,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:45:13,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:45:13,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:45:13,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:45:13,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:45:13,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:45:13,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:45:13,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:45:13,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:45:13,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:45:13,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:45:13,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:45:13,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:45:13,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:45:13,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:45:13,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:45:13,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:45:13,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:45:13,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:45:13,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:45:13,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:45:13,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:45:13,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:45:13,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:45:13,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:45:13,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:45:13,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:45:13,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:45:13,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:45:13,602 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 16:45:13,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:45:13,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:45:13,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:45:13,625 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:45:13,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:45:13,626 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:45:13,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:45:13,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:45:13,628 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:45:13,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:45:13,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:45:13,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:45:13,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:45:13,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:45:13,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:45:13,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:45:13,630 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:45:13,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:45:13,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:45:13,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:45:13,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:45:13,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:45:13,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:45:13,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:45:13,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:45:13,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:45:13,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:45:13,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:45:13,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:45:13,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:45:13,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:45:13,634 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:45:13,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:45:13,635 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_af592b9d-843a-45c0-bcd4-a13dd334b4c0/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_af592b9d-843a-45c0-bcd4-a13dd334b4c0/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 -> 4749945598aad49392ff7e08572aefcd51483347614bf2f6111264a526d0d26d [2022-11-25 16:45:14,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:45:14,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:45:14,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:45:14,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:45:14,050 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:45:14,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_44_good.i [2022-11-25 16:45:17,301 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:45:17,674 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:45:17,675 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_44_good.i [2022-11-25 16:45:17,702 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/data/d307ca774/8b3e707a7a42432181d67bf83c2011f9/FLAG1c1fde6c1 [2022-11-25 16:45:17,722 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/data/d307ca774/8b3e707a7a42432181d67bf83c2011f9 [2022-11-25 16:45:17,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:45:17,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:45:17,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:45:17,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:45:17,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:45:17,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:45:17" (1/1) ... [2022-11-25 16:45:17,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574637ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:17, skipping insertion in model container [2022-11-25 16:45:17,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:45:17" (1/1) ... [2022-11-25 16:45:17,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:45:17,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:45:18,382 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:45:18,941 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:45:18,948 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:45:18,954 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:45:18,960 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:45:18,961 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:45:19,024 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:45:19,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:45:19,036 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:45:19,056 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:45:19,102 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:45:19,104 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:45:19,105 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:45:19,108 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:45:19,109 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:45:19,116 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:45:19,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:45:19,244 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:45:19,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19 WrapperNode [2022-11-25 16:45:19,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:45:19,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:45:19,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:45:19,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:45:19,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,310 INFO L138 Inliner]: procedures = 504, calls = 68, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 65 [2022-11-25 16:45:19,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:45:19,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:45:19,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:45:19,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:45:19,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:45:19,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:45:19,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:45:19,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:45:19,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (1/1) ... [2022-11-25 16:45:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:45:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:45:19,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:45:19,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:45:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 16:45:19,430 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 16:45:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 16:45:19,431 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 16:45:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:45:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:45:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:45:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-25 16:45:19,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-25 16:45:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:45:19,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:45:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:45:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 16:45:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:45:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:45:19,708 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:45:19,711 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:45:19,942 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:45:19,949 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:45:19,949 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:45:19,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:45:19 BoogieIcfgContainer [2022-11-25 16:45:19,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:45:19,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:45:19,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:45:19,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:45:19,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:45:17" (1/3) ... [2022-11-25 16:45:19,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8e8f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:45:19, skipping insertion in model container [2022-11-25 16:45:19,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:19" (2/3) ... [2022-11-25 16:45:19,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8e8f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:45:19, skipping insertion in model container [2022-11-25 16:45:19,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:45:19" (3/3) ... [2022-11-25 16:45:19,963 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_44_good.i [2022-11-25 16:45:19,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:45:19,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 16:45:20,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:45:20,059 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;@2e7a50d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:45:20,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 16:45:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 34 states have internal predecessors, (36), 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 16:45:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 16:45:20,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:20,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:20,076 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 16:45:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash 232720563, now seen corresponding path program 1 times [2022-11-25 16:45:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:20,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696016723] [2022-11-25 16:45:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:20,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:20,674 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 16:45:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:20,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696016723] [2022-11-25 16:45:20,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696016723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:20,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:20,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:45:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643273727] [2022-11-25 16:45:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:20,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:45:20,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:45:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:45:20,747 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 34 states have internal predecessors, (36), 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 16:45:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:20,885 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-11-25 16:45:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:45:20,889 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 16:45:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:20,899 INFO L225 Difference]: With dead ends: 67 [2022-11-25 16:45:20,900 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 16:45:20,903 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 16:45:20,907 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:45:20,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 217 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:45:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 16:45:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-11-25 16:45:20,953 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 16:45:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-11-25 16:45:20,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 13 [2022-11-25 16:45:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:20,958 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-11-25 16:45:20,958 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 16:45:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-11-25 16:45:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 16:45:20,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:20,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:20,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:45:20,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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 16:45:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1376243481, now seen corresponding path program 1 times [2022-11-25 16:45:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:20,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044558954] [2022-11-25 16:45:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,038 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 16:45:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:21,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044558954] [2022-11-25 16:45:21,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044558954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:21,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:21,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:45:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270585419] [2022-11-25 16:45:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:21,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:45:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:45:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:45:21,042 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 16:45:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:21,061 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-25 16:45:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:45:21,062 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 16:45:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:21,063 INFO L225 Difference]: With dead ends: 46 [2022-11-25 16:45:21,063 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 16:45:21,064 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 16:45:21,065 INFO L413 NwaCegarLoop]: 37 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, 68 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 16:45:21,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:45:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 16:45:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-25 16:45:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.3) internal successors, (39), 35 states have internal predecessors, (39), 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 16:45:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-25 16:45:21,077 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 14 [2022-11-25 16:45:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:21,078 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-25 16:45:21,078 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 16:45:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-25 16:45:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 16:45:21,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:21,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:21,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:45:21,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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 16:45:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1375597049, now seen corresponding path program 1 times [2022-11-25 16:45:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:21,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579434702] [2022-11-25 16:45:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,141 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 16:45:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:21,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579434702] [2022-11-25 16:45:21,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579434702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:21,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:21,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:45:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211084740] [2022-11-25 16:45:21,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:21,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:45:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:45:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:45:21,144 INFO L87 Difference]: Start difference. First operand 42 states and 50 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 16:45:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:21,169 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-25 16:45:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:45:21,170 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 16:45:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:21,171 INFO L225 Difference]: With dead ends: 45 [2022-11-25 16:45:21,171 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 16:45:21,171 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 16:45:21,173 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 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 16:45:21,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:45:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 16:45:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-11-25 16:45:21,180 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 16:45:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-25 16:45:21,182 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 14 [2022-11-25 16:45:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:21,187 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-25 16:45:21,187 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 16:45:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-25 16:45:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 16:45:21,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:21,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:21,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:45:21,190 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 16:45:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:21,191 INFO L85 PathProgramCache]: Analyzing trace with hash 286125121, now seen corresponding path program 1 times [2022-11-25 16:45:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:21,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961580687] [2022-11-25 16:45:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,302 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 16:45:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:21,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961580687] [2022-11-25 16:45:21,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961580687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:21,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:21,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:45:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018096965] [2022-11-25 16:45:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:45:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:45:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:45:21,306 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 16:45:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:21,322 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-25 16:45:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:45:21,323 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 16:45:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:21,324 INFO L225 Difference]: With dead ends: 43 [2022-11-25 16:45:21,325 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 16:45:21,325 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 16:45:21,326 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 16:45:21,327 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 16:45:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 16:45:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-25 16:45:21,335 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 16:45:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-25 16:45:21,337 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-11-25 16:45:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:21,337 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-25 16:45:21,338 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 16:45:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-25 16:45:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 16:45:21,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:21,339 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 16:45:21,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:45:21,340 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 16:45:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash 748778227, now seen corresponding path program 1 times [2022-11-25 16:45:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:21,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317872818] [2022-11-25 16:45:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 16:45:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,505 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 16:45:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:21,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317872818] [2022-11-25 16:45:21,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317872818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:21,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:45:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901311588] [2022-11-25 16:45:21,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:21,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:45:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:45:21,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:45:21,510 INFO L87 Difference]: Start difference. First operand 35 states and 41 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 16:45:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:21,534 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-25 16:45:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:45:21,535 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 16:45:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:21,536 INFO L225 Difference]: With dead ends: 44 [2022-11-25 16:45:21,536 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 16:45:21,537 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 16:45:21,538 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 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 16:45:21,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:45:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 16:45:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 16:45:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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 16:45:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-11-25 16:45:21,570 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2022-11-25 16:45:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:21,571 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-11-25 16:45:21,571 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 16:45:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-11-25 16:45:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 16:45:21,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:21,573 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 16:45:21,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:45:21,573 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 16:45:21,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -618242424, now seen corresponding path program 1 times [2022-11-25 16:45:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:21,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554510331] [2022-11-25 16:45:21,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:21,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 16:45:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:21,767 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 16:45:21,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554510331] [2022-11-25 16:45:21,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554510331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:21,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:21,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:45:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245907225] [2022-11-25 16:45:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:21,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:45:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:21,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:45:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:45:21,772 INFO L87 Difference]: Start difference. First operand 28 states and 29 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 16:45:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:21,859 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-11-25 16:45:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:45:21,860 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 16:45:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:21,861 INFO L225 Difference]: With dead ends: 38 [2022-11-25 16:45:21,861 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 16:45:21,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:45:21,863 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:45:21,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:45:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 16:45:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 16:45:21,874 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 16:45:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-11-25 16:45:21,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2022-11-25 16:45:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:21,876 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-11-25 16:45:21,876 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 16:45:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-11-25 16:45:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:45:21,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:45:21,877 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 16:45:21,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:45:21,878 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 16:45:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -987128307, now seen corresponding path program 1 times [2022-11-25 16:45:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:21,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945548240] [2022-11-25 16:45:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:45:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 16:45:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:45:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:22,145 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 16:45:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:22,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945548240] [2022-11-25 16:45:22,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945548240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:22,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:22,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:45:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855683219] [2022-11-25 16:45:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:22,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:45:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:45:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:45:22,150 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 16:45:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:22,178 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-11-25 16:45:22,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:45:22,179 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 16:45:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:45:22,180 INFO L225 Difference]: With dead ends: 28 [2022-11-25 16:45:22,181 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 16:45:22,182 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 16:45:22,188 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 16:45:22,189 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 16:45:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 16:45:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 16:45:22,195 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 16:45:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 16:45:22,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-11-25 16:45:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:45:22,200 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:45:22,200 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 16:45:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:45:22,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 16:45:22,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 16:45:22,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 16:45:22,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 16:45:22,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 16:45:22,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:45:22,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 16:45:22,354 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 16:45:22,355 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:45:22,355 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 16:45:22,355 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:45:22,355 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:45:22,356 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 16:45:22,356 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:45:22,356 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,356 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,356 INFO L895 garLoopResultBuilder]: At program point L1598(lines 1592 1599) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2)) [2022-11-25 16:45:22,357 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,357 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2)) [2022-11-25 16:45:22,357 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,357 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-25 16:45:22,357 INFO L902 garLoopResultBuilder]: At program point L1595(line 1595) the Hoare annotation is: true [2022-11-25 16:45:22,358 INFO L899 garLoopResultBuilder]: For program point L1595-1(line 1595) no Hoare annotation was computed. [2022-11-25 16:45:22,358 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodG2B_~funcPtr~0#1.offset| |#funAddr~goodG2BSink.offset|) (<= .cse0 0))) [2022-11-25 16:45:22,358 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-25 16:45:22,358 INFO L899 garLoopResultBuilder]: For program point L1587(lines 1587 1591) no Hoare annotation was computed. [2022-11-25 16:45:22,359 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~0#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodB2G_~funcPtr~1#1.base| |#funAddr~goodB2GSink.base|) (<= |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset| |#funAddr~goodB2GSink.offset|) (<= |#funAddr~goodB2GSink.offset| |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset|) (<= |#funAddr~goodB2GSink.base| |ULTIMATE.start_goodB2G_~funcPtr~1#1.base|) (<= |ULTIMATE.start_goodG2B_~funcPtr~0#1.offset| |#funAddr~goodG2BSink.offset|) (<= .cse0 0))) [2022-11-25 16:45:22,359 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2022-11-25 16:45:22,359 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1586) no Hoare annotation was computed. [2022-11-25 16:45:22,359 INFO L895 garLoopResultBuilder]: At program point L1553(line 1553) the Hoare annotation is: (or (and (= |##fun~int~TO~VOID_goodG2BSink_~data#1| |##fun~int~TO~VOID_#in~94#1|) (= |##fun~int~TO~VOID_#~94#1| |##fun~int~TO~VOID_#in~94#1|) (<= (+ |##fun~int~TO~VOID_goodG2BSink_~data#1| 1) 0)) (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~94#1|)))) [2022-11-25 16:45:22,360 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1552) no Hoare annotation was computed. [2022-11-25 16:45:22,360 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1570) no Hoare annotation was computed. [2022-11-25 16:45:22,360 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,360 INFO L902 garLoopResultBuilder]: At program point ##fun~int~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-25 16:45:22,361 INFO L899 garLoopResultBuilder]: For program point L1570(line 1570) no Hoare annotation was computed. [2022-11-25 16:45:22,361 INFO L899 garLoopResultBuilder]: For program point L1570-1(line 1570) no Hoare annotation was computed. [2022-11-25 16:45:22,362 INFO L899 garLoopResultBuilder]: For program point L1568(lines 1568 1576) no Hoare annotation was computed. [2022-11-25 16:45:22,362 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,362 INFO L899 garLoopResultBuilder]: For program point L1566(lines 1566 1577) no Hoare annotation was computed. [2022-11-25 16:45:22,362 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-25 16:45:22,362 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1578) no Hoare annotation was computed. [2022-11-25 16:45:22,363 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1552) no Hoare annotation was computed. [2022-11-25 16:45:22,363 INFO L899 garLoopResultBuilder]: For program point L1552(line 1552) no Hoare annotation was computed. [2022-11-25 16:45:22,363 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-25 16:45:22,364 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1570) no Hoare annotation was computed. [2022-11-25 16:45:22,364 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1554) no Hoare annotation was computed. [2022-11-25 16:45:22,364 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1555) no Hoare annotation was computed. [2022-11-25 16:45:22,364 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (or (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~94#1|))) (and (<= (+ |##fun~int~TO~VOID_goodB2GSink_~data#1| 1) 0) (<= |#funAddr~goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (<= 0 (+ 2 |##fun~int~TO~VOID_#~94#1|)))) [2022-11-25 16:45:22,365 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (or (and (<= (+ |##fun~int~TO~VOID_goodB2GSink_~data#1| 1) 0) (<= |#funAddr~goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (<= 0 (+ 2 |##fun~int~TO~VOID_#~94#1|)) (<= 0 (+ |##fun~int~TO~VOID_goodB2GSink_~data#1| 1073741823))) (not (<= 0 (+ 2 |##fun~int~TO~VOID_#in~94#1|)))) [2022-11-25 16:45:22,373 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:22,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:45:22,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:45:22 BoogieIcfgContainer [2022-11-25 16:45:22,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:45:22,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:45:22,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:45:22,393 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:45:22,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:45:19" (3/4) ... [2022-11-25 16:45:22,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 16:45:22,404 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 16:45:22,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 16:45:22,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2022-11-25 16:45:22,412 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-25 16:45:22,412 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-25 16:45:22,413 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 16:45:22,413 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:45:22,460 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:45:22,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:45:22,463 INFO L158 Benchmark]: Toolchain (without parser) took 4736.19ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 103.6MB in the beginning and 79.7MB in the end (delta: 23.9MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-11-25 16:45:22,463 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:45:22,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1516.59ms. Allocated memory is still 146.8MB. Free memory was 103.6MB in the beginning and 66.6MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 16:45:22,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.84ms. Allocated memory is still 146.8MB. Free memory was 66.6MB in the beginning and 63.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:45:22,464 INFO L158 Benchmark]: Boogie Preprocessor took 30.63ms. Allocated memory is still 146.8MB. Free memory was 63.3MB in the beginning and 61.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:45:22,465 INFO L158 Benchmark]: RCFGBuilder took 609.83ms. Allocated memory is still 146.8MB. Free memory was 61.8MB in the beginning and 47.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 16:45:22,466 INFO L158 Benchmark]: TraceAbstraction took 2436.86ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 47.1MB in the beginning and 82.8MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:45:22,466 INFO L158 Benchmark]: Witness Printer took 69.71ms. Allocated memory is still 176.2MB. Free memory was 82.8MB in the beginning and 79.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:45:22,468 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.35ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1516.59ms. Allocated memory is still 146.8MB. Free memory was 103.6MB in the beginning and 66.6MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.84ms. Allocated memory is still 146.8MB. Free memory was 66.6MB in the beginning and 63.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.63ms. Allocated memory is still 146.8MB. Free memory was 63.3MB in the beginning and 61.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.83ms. Allocated memory is still 146.8MB. Free memory was 61.8MB in the beginning and 47.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2436.86ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 47.1MB in the beginning and 82.8MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.71ms. Allocated memory is still 176.2MB. Free memory was 82.8MB in the beginning and 79.7MB 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: 1570]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1570]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1552]: 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, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 660 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 241 mSDtfsCounter, 100 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, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 29 PreInvPairs, 30 NumberOfFragments, 120 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 25 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s 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: 1592]: Loop Invariant Derived loop invariant: 0 <= data + 2 RESULT: Ultimate proved your program to be correct! [2022-11-25 16:45:22,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af592b9d-843a-45c0-bcd4-a13dd334b4c0/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