./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a 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_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- 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-5e519f3 [2022-11-02 20:32:23,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:32:23,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:32:23,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:32:23,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:32:23,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:32:23,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:32:23,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:32:23,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:32:23,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:32:23,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:32:23,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:32:23,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:32:23,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:32:23,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:32:23,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:32:23,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:32:23,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:32:23,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:32:23,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:32:23,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:32:23,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:32:23,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:32:23,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:32:23,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:32:23,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:32:23,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:32:23,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:32:23,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:32:23,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:32:23,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:32:23,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:32:23,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:32:23,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:32:23,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:32:23,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:32:23,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:32:23,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:32:23,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:32:23,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:32:23,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:32:23,297 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:32:23,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:32:23,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:32:23,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:32:23,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:32:23,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:32:23,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:32:23,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:32:23,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:32:23,336 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:32:23,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:32:23,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:32:23,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:32:23,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:32:23,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:32:23,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:32:23,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:32:23,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:32:23,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:32:23,339 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:32:23,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:32:23,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:32:23,340 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:32:23,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:32:23,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:32:23,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:32:23,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:32:23,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:23,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:32:23,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:32:23,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:32:23,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:32:23,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:32:23,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:32:23,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/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_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-11-02 20:32:23,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:32:23,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:32:23,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:32:23,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:32:23,699 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:32:23,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-11-02 20:32:23,789 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/data/d0fcdfcf7/d2b6f2e56c364313b55dbf48d61ffb77/FLAGd72a01e8d [2022-11-02 20:32:24,349 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:32:24,350 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-11-02 20:32:24,365 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/data/d0fcdfcf7/d2b6f2e56c364313b55dbf48d61ffb77/FLAGd72a01e8d [2022-11-02 20:32:24,652 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/data/d0fcdfcf7/d2b6f2e56c364313b55dbf48d61ffb77 [2022-11-02 20:32:24,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:32:24,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:32:24,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:24,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:32:24,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:32:24,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:24" (1/1) ... [2022-11-02 20:32:24,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756fbf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:24, skipping insertion in model container [2022-11-02 20:32:24,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:24" (1/1) ... [2022-11-02 20:32:24,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:32:24,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:32:24,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-11-02 20:32:25,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:25,083 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:32:25,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-11-02 20:32:25,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:25,184 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:32:25,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25 WrapperNode [2022-11-02 20:32:25,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:25,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:25,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:32:25,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:32:25,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,255 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-11-02 20:32:25,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:25,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:32:25,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:32:25,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:32:25,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,315 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:32:25,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:32:25,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:32:25,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:32:25,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (1/1) ... [2022-11-02 20:32:25,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:25,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:25,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:32:25,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:32:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:32:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:32:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-11-02 20:32:25,425 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-11-02 20:32:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:32:25,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:32:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-11-02 20:32:25,426 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-11-02 20:32:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:32:25,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:32:25,514 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:32:25,517 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:32:25,959 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:32:25,988 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:32:25,988 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:32:25,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:25 BoogieIcfgContainer [2022-11-02 20:32:25,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:32:25,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:32:25,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:32:26,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:32:26,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:32:24" (1/3) ... [2022-11-02 20:32:26,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2daf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:26, skipping insertion in model container [2022-11-02 20:32:26,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:25" (2/3) ... [2022-11-02 20:32:26,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2daf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:26, skipping insertion in model container [2022-11-02 20:32:26,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:25" (3/3) ... [2022-11-02 20:32:26,005 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-11-02 20:32:26,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:32:26,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-02 20:32:26,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:32:26,130 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70019c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:32:26,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-02 20:32:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 71 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:32:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:32:26,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:26,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:26,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash 773389610, now seen corresponding path program 1 times [2022-11-02 20:32:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:26,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604238404] [2022-11-02 20:32:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:26,363 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-02 20:32:26,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604238404] [2022-11-02 20:32:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604238404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:26,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:26,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259720087] [2022-11-02 20:32:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:26,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:32:26,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:26,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:32:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:32:26,420 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 71 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:26,489 INFO L93 Difference]: Finished difference Result 163 states and 219 transitions. [2022-11-02 20:32:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:32:26,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:32:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:26,508 INFO L225 Difference]: With dead ends: 163 [2022-11-02 20:32:26,508 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:32:26,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:32:26,523 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:26,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:32:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 20:32:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 61 states have internal predecessors, (72), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-11-02 20:32:26,582 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 9 [2022-11-02 20:32:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:26,583 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-11-02 20:32:26,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-11-02 20:32:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:32:26,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:26,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:32:26,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash 772448344, now seen corresponding path program 1 times [2022-11-02 20:32:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:26,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011557293] [2022-11-02 20:32:26,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:26,790 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-02 20:32:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011557293] [2022-11-02 20:32:26,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011557293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:26,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:26,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853344974] [2022-11-02 20:32:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:26,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:32:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:26,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:32:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:32:26,799 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:27,024 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2022-11-02 20:32:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:32:27,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:32:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:27,033 INFO L225 Difference]: With dead ends: 181 [2022-11-02 20:32:27,036 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:32:27,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:27,038 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:27,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 230 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:32:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2022-11-02 20:32:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 91 states have internal predecessors, (115), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2022-11-02 20:32:27,060 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 9 [2022-11-02 20:32:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:27,070 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2022-11-02 20:32:27,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-11-02 20:32:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:32:27,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:27,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:27,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:32:27,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash -324169121, now seen corresponding path program 1 times [2022-11-02 20:32:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:27,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354404153] [2022-11-02 20:32:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:27,321 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-02 20:32:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354404153] [2022-11-02 20:32:27,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354404153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:27,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:27,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506720846] [2022-11-02 20:32:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:27,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:27,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:27,330 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:27,549 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-11-02 20:32:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:32:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:27,551 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:32:27,551 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:32:27,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:27,554 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 72 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:27,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 310 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:32:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:32:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-11-02 20:32:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 93 states have internal predecessors, (116), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2022-11-02 20:32:27,575 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 13 [2022-11-02 20:32:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:27,575 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-11-02 20:32:27,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-11-02 20:32:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:32:27,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:27,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:27,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:32:27,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1459308058, now seen corresponding path program 1 times [2022-11-02 20:32:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:27,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885743280] [2022-11-02 20:32:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:27,692 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-02 20:32:27,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:27,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885743280] [2022-11-02 20:32:27,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885743280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:27,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:27,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:27,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243054329] [2022-11-02 20:32:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:27,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:27,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:27,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:27,696 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:27,860 INFO L93 Difference]: Finished difference Result 198 states and 239 transitions. [2022-11-02 20:32:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:32:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:27,863 INFO L225 Difference]: With dead ends: 198 [2022-11-02 20:32:27,863 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:32:27,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:27,866 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 84 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:27,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 313 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:32:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2022-11-02 20:32:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 97 states have internal predecessors, (120), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-11-02 20:32:27,883 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 14 [2022-11-02 20:32:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:27,884 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-11-02 20:32:27,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-11-02 20:32:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:32:27,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:27,886 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:27,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:32:27,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1921948498, now seen corresponding path program 1 times [2022-11-02 20:32:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:27,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638370028] [2022-11-02 20:32:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:27,974 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-02 20:32:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:27,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638370028] [2022-11-02 20:32:27,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638370028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:27,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:27,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186711529] [2022-11-02 20:32:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:27,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:27,990 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 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-02 20:32:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:28,103 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2022-11-02 20:32:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 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 16 [2022-11-02 20:32:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:28,108 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:32:28,108 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 20:32:28,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:28,120 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:28,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 283 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 20:32:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-11-02 20:32:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 117 states have internal predecessors, (150), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2022-11-02 20:32:28,162 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 16 [2022-11-02 20:32:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:28,162 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2022-11-02 20:32:28,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 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-02 20:32:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-11-02 20:32:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:32:28,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:28,164 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:32:28,165 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 387438536, now seen corresponding path program 1 times [2022-11-02 20:32:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569112839] [2022-11-02 20:32:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:28,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:28,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569112839] [2022-11-02 20:32:28,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569112839] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772374452] [2022-11-02 20:32:28,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:28,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:28,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:28,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:32:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:32:28,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:28,456 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-02 20:32:28,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:32:28,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772374452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:28,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:32:28,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-02 20:32:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600346679] [2022-11-02 20:32:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:28,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:32:28,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:28,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:32:28,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:28,460 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:28,538 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2022-11-02 20:32:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:32:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:32:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:28,541 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:32:28,541 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:32:28,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:28,549 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:28,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:32:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2022-11-02 20:32:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 115 states have internal predecessors, (146), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 161 transitions. [2022-11-02 20:32:28,584 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 161 transitions. Word has length 15 [2022-11-02 20:32:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:28,584 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 161 transitions. [2022-11-02 20:32:28,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-11-02 20:32:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:32:28,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:28,591 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:28,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:28,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:32:28,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 549138763, now seen corresponding path program 1 times [2022-11-02 20:32:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:28,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250771872] [2022-11-02 20:32:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:32:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:28,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250771872] [2022-11-02 20:32:28,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250771872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:28,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:28,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412472786] [2022-11-02 20:32:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:28,850 INFO L87 Difference]: Start difference. First operand 128 states and 161 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02 20:32:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:28,897 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-11-02 20:32:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:28,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2022-11-02 20:32:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:28,899 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:32:28,900 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:32:28,900 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-02 20:32:28,901 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:28,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:32:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-11-02 20:32:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.41) internal successors, (141), 112 states have internal predecessors, (141), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2022-11-02 20:32:28,915 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 17 [2022-11-02 20:32:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:28,915 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2022-11-02 20:32:28,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02 20:32:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2022-11-02 20:32:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:32:28,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:28,917 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:28,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:32:28,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash 730880598, now seen corresponding path program 1 times [2022-11-02 20:32:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465180290] [2022-11-02 20:32:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,983 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-02 20:32:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465180290] [2022-11-02 20:32:28,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465180290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:28,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:28,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205708945] [2022-11-02 20:32:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:28,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:28,987 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 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-02 20:32:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:29,077 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2022-11-02 20:32:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 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 18 [2022-11-02 20:32:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:29,079 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:32:29,080 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:32:29,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:29,081 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:29,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 282 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:32:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2022-11-02 20:32:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 115 states have internal predecessors, (143), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-11-02 20:32:29,096 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 18 [2022-11-02 20:32:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:29,096 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-11-02 20:32:29,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 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-02 20:32:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-11-02 20:32:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:32:29,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:29,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:32:29,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1398879560, now seen corresponding path program 1 times [2022-11-02 20:32:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:29,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768311175] [2022-11-02 20:32:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:32:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768311175] [2022-11-02 20:32:29,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768311175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:29,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:29,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533336365] [2022-11-02 20:32:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:29,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:32:29,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:32:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:32:29,157 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:29,208 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2022-11-02 20:32:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:32:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:32:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:29,210 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:32:29,211 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:32:29,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:32:29,212 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:29,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:32:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2022-11-02 20:32:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.39) internal successors, (139), 112 states have internal predecessors, (139), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2022-11-02 20:32:29,225 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 19 [2022-11-02 20:32:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:29,226 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2022-11-02 20:32:29,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2022-11-02 20:32:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:32:29,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:29,228 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:29,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:32:29,228 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash -580722214, now seen corresponding path program 1 times [2022-11-02 20:32:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:29,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590039360] [2022-11-02 20:32:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:32:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:29,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590039360] [2022-11-02 20:32:29,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590039360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:29,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:29,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:29,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134094018] [2022-11-02 20:32:29,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:29,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:29,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:29,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:29,300 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:32:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:29,386 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2022-11-02 20:32:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:29,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-02 20:32:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:29,389 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:32:29,389 INFO L226 Difference]: Without dead ends: 137 [2022-11-02 20:32:29,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:29,390 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 57 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:29,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 279 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-02 20:32:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2022-11-02 20:32:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 106 states have internal predecessors, (131), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2022-11-02 20:32:29,404 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 23 [2022-11-02 20:32:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:29,404 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2022-11-02 20:32:29,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:32:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-11-02 20:32:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:32:29,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:29,406 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:29,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:32:29,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1159150722, now seen corresponding path program 1 times [2022-11-02 20:32:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:29,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992964421] [2022-11-02 20:32:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:32:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:29,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992964421] [2022-11-02 20:32:29,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992964421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:29,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:29,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:29,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557619625] [2022-11-02 20:32:29,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:29,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:29,476 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:32:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:29,564 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2022-11-02 20:32:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:29,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-02 20:32:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:29,567 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:32:29,567 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:32:29,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:29,573 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 47 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:29,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 279 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:32:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2022-11-02 20:32:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 101 states have internal predecessors, (126), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:32:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2022-11-02 20:32:29,594 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 25 [2022-11-02 20:32:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:29,595 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2022-11-02 20:32:29,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:32:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2022-11-02 20:32:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:32:29,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:29,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:29,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:32:29,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash -160828526, now seen corresponding path program 1 times [2022-11-02 20:32:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:29,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037131945] [2022-11-02 20:32:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:32:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:32:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:29,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037131945] [2022-11-02 20:32:29,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037131945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:29,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105389501] [2022-11-02 20:32:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:29,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:29,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:32:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:32:29,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:32:30,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:32:30,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105389501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:32:30,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:32:30,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-11-02 20:32:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438290067] [2022-11-02 20:32:30,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:32:30,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:32:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:32:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:32:30,406 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:32:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:30,974 INFO L93 Difference]: Finished difference Result 262 states and 323 transitions. [2022-11-02 20:32:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:32:30,975 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-11-02 20:32:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:30,977 INFO L225 Difference]: With dead ends: 262 [2022-11-02 20:32:30,978 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:32:30,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:32:30,981 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:30,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 724 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:32:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:32:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2022-11-02 20:32:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 87 states have internal predecessors, (104), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-02 20:32:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2022-11-02 20:32:31,003 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 29 [2022-11-02 20:32:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:31,003 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2022-11-02 20:32:31,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:32:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2022-11-02 20:32:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:32:31,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:31,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:31,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:31,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:32:31,233 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1943877825, now seen corresponding path program 1 times [2022-11-02 20:32:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:31,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169888805] [2022-11-02 20:32:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:32:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:32:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:31,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169888805] [2022-11-02 20:32:31,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169888805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:31,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:31,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219752546] [2022-11-02 20:32:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:31,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:31,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:31,426 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:32:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:31,542 INFO L93 Difference]: Finished difference Result 166 states and 198 transitions. [2022-11-02 20:32:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:32:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-11-02 20:32:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:31,546 INFO L225 Difference]: With dead ends: 166 [2022-11-02 20:32:31,546 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:32:31,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:32:31,549 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 12 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:31,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 506 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:32:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2022-11-02 20:32:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.302325581395349) internal successors, (112), 96 states have internal predecessors, (112), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-02 20:32:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2022-11-02 20:32:31,571 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 33 [2022-11-02 20:32:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:31,572 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2022-11-02 20:32:31,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:32:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2022-11-02 20:32:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:32:31,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:31,574 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:32:31,575 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 842429999, now seen corresponding path program 1 times [2022-11-02 20:32:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:31,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636852973] [2022-11-02 20:32:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:32:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:32:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:32:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636852973] [2022-11-02 20:32:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636852973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:31,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:31,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:32:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455142384] [2022-11-02 20:32:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:31,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:32:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:32:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:32:31,833 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:32:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:32,053 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2022-11-02 20:32:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:32:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-02 20:32:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:32,055 INFO L225 Difference]: With dead ends: 184 [2022-11-02 20:32:32,055 INFO L226 Difference]: Without dead ends: 144 [2022-11-02 20:32:32,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:32:32,056 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 69 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:32,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 616 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:32:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-02 20:32:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2022-11-02 20:32:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 114 states have internal predecessors, (138), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-02 20:32:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2022-11-02 20:32:32,072 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 37 [2022-11-02 20:32:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:32,072 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2022-11-02 20:32:32,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:32:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-11-02 20:32:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:32:32,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:32,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:32,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:32:32,074 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1505015026, now seen corresponding path program 2 times [2022-11-02 20:32:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:32,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184169152] [2022-11-02 20:32:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:32:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:32:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:32,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184169152] [2022-11-02 20:32:32,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184169152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:32,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:32,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:32:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947614174] [2022-11-02 20:32:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:32,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:32:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:32:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:32:32,359 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:32:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:32,646 INFO L93 Difference]: Finished difference Result 257 states and 315 transitions. [2022-11-02 20:32:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:32:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-02 20:32:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:32,649 INFO L225 Difference]: With dead ends: 257 [2022-11-02 20:32:32,649 INFO L226 Difference]: Without dead ends: 215 [2022-11-02 20:32:32,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:32:32,651 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 147 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:32,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1003 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:32:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-02 20:32:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2022-11-02 20:32:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.330935251798561) internal successors, (185), 149 states have internal predecessors, (185), 20 states have call successors, (20), 10 states have call predecessors, (20), 12 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-02 20:32:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2022-11-02 20:32:32,673 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 37 [2022-11-02 20:32:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:32,674 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2022-11-02 20:32:32,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:32:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2022-11-02 20:32:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:32:32,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:32,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:32,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:32:32,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1505074608, now seen corresponding path program 1 times [2022-11-02 20:32:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:32,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645367703] [2022-11-02 20:32:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:32:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:32:32,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:32,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645367703] [2022-11-02 20:32:32,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645367703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:32,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860887031] [2022-11-02 20:32:32,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:32,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:32,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:32:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:33,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:32:33,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:32:33,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:32:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860887031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:32:33,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:32:33,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-11-02 20:32:33,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845691921] [2022-11-02 20:32:33,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:32:33,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:32:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:32:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:32:33,468 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:32:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:34,002 INFO L93 Difference]: Finished difference Result 337 states and 433 transitions. [2022-11-02 20:32:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:32:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-11-02 20:32:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:34,005 INFO L225 Difference]: With dead ends: 337 [2022-11-02 20:32:34,005 INFO L226 Difference]: Without dead ends: 277 [2022-11-02 20:32:34,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:32:34,007 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:34,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 991 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:32:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-02 20:32:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2022-11-02 20:32:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 184 states have (on average 1.358695652173913) internal successors, (250), 195 states have internal predecessors, (250), 29 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (35), 28 states have call predecessors, (35), 27 states have call successors, (35) [2022-11-02 20:32:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 314 transitions. [2022-11-02 20:32:34,043 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 314 transitions. Word has length 37 [2022-11-02 20:32:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:34,044 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 314 transitions. [2022-11-02 20:32:34,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:32:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 314 transitions. [2022-11-02 20:32:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:32:34,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:34,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:34,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:32:34,263 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2116326705, now seen corresponding path program 1 times [2022-11-02 20:32:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:34,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141189861] [2022-11-02 20:32:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:32:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:32:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:32:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:34,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141189861] [2022-11-02 20:32:34,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141189861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:34,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891464937] [2022-11-02 20:32:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:34,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:34,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:34,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:32:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:32:34,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:32:34,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:32:34,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891464937] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:32:34,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:32:34,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2022-11-02 20:32:34,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919403481] [2022-11-02 20:32:34,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:32:34,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:32:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:34,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:32:34,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:32:34,983 INFO L87 Difference]: Start difference. First operand 236 states and 314 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:32:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:35,403 INFO L93 Difference]: Finished difference Result 350 states and 457 transitions. [2022-11-02 20:32:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:32:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-11-02 20:32:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:35,407 INFO L225 Difference]: With dead ends: 350 [2022-11-02 20:32:35,407 INFO L226 Difference]: Without dead ends: 256 [2022-11-02 20:32:35,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:32:35,409 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 763 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:32:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-02 20:32:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 215. [2022-11-02 20:32:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 169 states have (on average 1.3727810650887573) internal successors, (232), 179 states have internal predecessors, (232), 26 states have call successors, (26), 10 states have call predecessors, (26), 12 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2022-11-02 20:32:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 287 transitions. [2022-11-02 20:32:35,443 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 287 transitions. Word has length 39 [2022-11-02 20:32:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:35,443 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 287 transitions. [2022-11-02 20:32:35,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:32:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 287 transitions. [2022-11-02 20:32:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:32:35,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:35,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:35,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:35,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:32:35,661 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash 400561606, now seen corresponding path program 1 times [2022-11-02 20:32:35,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:35,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374812193] [2022-11-02 20:32:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:32:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:32:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:32:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374812193] [2022-11-02 20:32:36,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374812193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:36,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:36,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:32:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738795270] [2022-11-02 20:32:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:36,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:32:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:32:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:36,207 INFO L87 Difference]: Start difference. First operand 215 states and 287 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:32:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:36,652 INFO L93 Difference]: Finished difference Result 248 states and 318 transitions. [2022-11-02 20:32:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:32:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-02 20:32:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:36,655 INFO L225 Difference]: With dead ends: 248 [2022-11-02 20:32:36,655 INFO L226 Difference]: Without dead ends: 247 [2022-11-02 20:32:36,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:32:36,656 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 168 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:36,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 702 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:32:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-02 20:32:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 215. [2022-11-02 20:32:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 179 states have internal predecessors, (231), 26 states have call successors, (26), 10 states have call predecessors, (26), 12 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2022-11-02 20:32:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 286 transitions. [2022-11-02 20:32:36,690 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 286 transitions. Word has length 39 [2022-11-02 20:32:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:36,691 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 286 transitions. [2022-11-02 20:32:36,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:32:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 286 transitions. [2022-11-02 20:32:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:32:36,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:36,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:36,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:32:36,694 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-02 20:32:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1372660028, now seen corresponding path program 1 times [2022-11-02 20:32:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:36,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354053691] [2022-11-02 20:32:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:32:36,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:32:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:32:36,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:32:36,808 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:32:36,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-02 20:32:36,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-02 20:32:36,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-02 20:32:36,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-02 20:32:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-02 20:32:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-02 20:32:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-02 20:32:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-02 20:32:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-02 20:32:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-02 20:32:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-02 20:32:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-02 20:32:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-02 20:32:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-02 20:32:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-02 20:32:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-02 20:32:36,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:32:36,822 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:36,828 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:32:36,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:32:36 BoogieIcfgContainer [2022-11-02 20:32:36,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:32:36,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:32:36,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:32:36,899 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:32:36,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:25" (3/4) ... [2022-11-02 20:32:36,904 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:32:36,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:32:36,905 INFO L158 Benchmark]: Toolchain (without parser) took 12247.61ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 75.0MB in the beginning and 87.3MB in the end (delta: -12.3MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-11-02 20:32:36,905 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 119.5MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:32:36,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.44ms. Allocated memory is still 119.5MB. Free memory was 74.8MB in the beginning and 90.0MB in the end (delta: -15.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:32:36,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.43ms. Allocated memory is still 119.5MB. Free memory was 90.0MB in the beginning and 88.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:32:36,907 INFO L158 Benchmark]: Boogie Preprocessor took 63.39ms. Allocated memory is still 119.5MB. Free memory was 88.4MB in the beginning and 87.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:32:36,907 INFO L158 Benchmark]: RCFGBuilder took 670.32ms. Allocated memory is still 119.5MB. Free memory was 86.8MB in the beginning and 69.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:32:36,907 INFO L158 Benchmark]: TraceAbstraction took 10904.46ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 69.0MB in the beginning and 87.3MB in the end (delta: -18.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-11-02 20:32:36,908 INFO L158 Benchmark]: Witness Printer took 5.68ms. Allocated memory is still 174.1MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:32:36,910 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.39ms. Allocated memory is still 119.5MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.44ms. Allocated memory is still 119.5MB. Free memory was 74.8MB in the beginning and 90.0MB in the end (delta: -15.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.43ms. Allocated memory is still 119.5MB. Free memory was 90.0MB in the beginning and 88.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.39ms. Allocated memory is still 119.5MB. Free memory was 88.4MB in the beginning and 87.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 670.32ms. Allocated memory is still 119.5MB. Free memory was 86.8MB in the beginning and 69.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10904.46ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 69.0MB in the beginning and 87.3MB in the end (delta: -18.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Witness Printer took 5.68ms. Allocated memory is still 174.1MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseOr at line 110, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=127, eb=-125] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=-125] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=-125, ma=33554432, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-125, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m)=16777216, e=-125, m=0] [L77] EXPR e + 128 [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-125, \old(m)=16777216, __retres4=1, e=-125, m=0, res=1] [L80] return (__retres4); VAL [\old(e)=-125, \old(m)=16777216, \result=36028797018963969, __retres4=1, e=-125, m=0, res=1] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=36028797018963969, ea=127, eb=-125, ma=33554432, mb=16777216, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=1] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ma=0] [L109] EXPR (int )(a >> 24U) - 128 [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127, mb=0] [L112] (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127, mb=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1119 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 7881 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6344 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1632 IncrementalHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 1537 mSDtfsCounter, 1632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 277 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 396 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1754 SizeOfPredicates, 11 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 214/259 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:32:36,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c20f783-6c6d-4900-85be-a01023d92c6c/bin/uautomizer-Dbtcem3rbc/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample