./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS --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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- 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-4e7fbc6 [2022-11-23 02:16:14,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:16:15,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:16:15,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:16:15,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:16:15,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:16:15,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:16:15,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:16:15,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:16:15,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:16:15,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:16:15,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:16:15,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:16:15,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:16:15,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:16:15,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:16:15,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:16:15,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:16:15,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:16:15,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:16:15,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:16:15,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:16:15,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:16:15,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:16:15,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:16:15,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:16:15,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:16:15,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:16:15,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:16:15,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:16:15,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:16:15,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:16:15,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:16:15,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:16:15,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:16:15,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:16:15,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:16:15,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:16:15,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:16:15,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:16:15,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:16:15,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-23 02:16:15,156 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:16:15,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:16:15,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:16:15,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:16:15,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:16:15,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:16:15,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:16:15,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:16:15,164 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:16:15,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:16:15,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:16:15,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:16:15,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:16:15,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:16:15,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:16:15,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:16:15,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:16:15,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:16:15,168 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 02:16:15,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:16:15,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:16:15,169 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:16:15,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:16:15,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:16:15,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:16:15,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:16:15,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:16:15,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:16:15,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:16:15,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:16:15,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:16:15,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:16:15,173 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:16:15,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:16:15,174 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:16:15,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:16:15,174 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/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_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2022-11-23 02:16:15,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:16:15,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:16:15,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:16:15,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:16:15,512 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:16:15,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2022-11-23 02:16:18,410 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:16:18,676 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:16:18,676 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2022-11-23 02:16:18,685 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data/62b1945a1/632d5d4bc36f44f6a8127a92819f0dec/FLAGe99f53b9f [2022-11-23 02:16:18,702 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data/62b1945a1/632d5d4bc36f44f6a8127a92819f0dec [2022-11-23 02:16:18,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:16:18,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:16:18,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:16:18,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:16:18,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:16:18,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:18" (1/1) ... [2022-11-23 02:16:18,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b29ae65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:18, skipping insertion in model container [2022-11-23 02:16:18,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:18" (1/1) ... [2022-11-23 02:16:18,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:16:18,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:16:18,891 WARN L237 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_1f67bd50-82d6-4db8-9d49-720f9af82aab/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c[727,740] [2022-11-23 02:16:18,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:16:18,968 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:16:18,979 WARN L237 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_1f67bd50-82d6-4db8-9d49-720f9af82aab/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c[727,740] [2022-11-23 02:16:19,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:16:19,031 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:16:19,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19 WrapperNode [2022-11-23 02:16:19,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:16:19,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:16:19,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:16:19,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:16:19,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,117 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2022-11-23 02:16:19,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:16:19,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:16:19,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:16:19,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:16:19,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:16:19,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:16:19,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:16:19,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:16:19,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (1/1) ... [2022-11-23 02:16:19,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:16:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:19,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:16:19,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:16:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:16:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:16:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-11-23 02:16:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-11-23 02:16:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:16:19,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:16:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 02:16:19,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 02:16:19,398 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:16:19,401 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:16:19,967 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:16:19,975 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:16:19,976 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 02:16:19,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:19 BoogieIcfgContainer [2022-11-23 02:16:19,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:16:19,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:16:19,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:16:19,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:16:19,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:16:18" (1/3) ... [2022-11-23 02:16:19,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32776e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:19, skipping insertion in model container [2022-11-23 02:16:19,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:19" (2/3) ... [2022-11-23 02:16:19,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32776e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:19, skipping insertion in model container [2022-11-23 02:16:19,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:19" (3/3) ... [2022-11-23 02:16:19,988 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2022-11-23 02:16:20,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:16:20,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-11-23 02:16:20,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:16:20,074 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15e1bfc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:16:20,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-23 02:16:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 89 states have (on average 1.7078651685393258) internal successors, (152), 114 states have internal predecessors, (152), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:16:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 02:16:20,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:20,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:20,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1859144894, now seen corresponding path program 1 times [2022-11-23 02:16:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332507868] [2022-11-23 02:16:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:20,435 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-23 02:16:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:20,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332507868] [2022-11-23 02:16:20,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332507868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:20,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:20,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:16:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621170851] [2022-11-23 02:16:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:20,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:16:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:20,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:16:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:16:20,503 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.7078651685393258) internal successors, (152), 114 states have internal predecessors, (152), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-23 02:16:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:20,656 INFO L93 Difference]: Finished difference Result 294 states and 413 transitions. [2022-11-23 02:16:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:16:20,659 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-23 02:16:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:20,670 INFO L225 Difference]: With dead ends: 294 [2022-11-23 02:16:20,671 INFO L226 Difference]: Without dead ends: 154 [2022-11-23 02:16:20,675 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-23 02:16:20,679 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 87 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:20,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 409 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:16:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-23 02:16:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2022-11-23 02:16:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 134 states have internal predecessors, (176), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2022-11-23 02:16:20,774 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 9 [2022-11-23 02:16:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:20,774 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2022-11-23 02:16:20,775 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-23 02:16:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2022-11-23 02:16:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 02:16:20,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:20,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:20,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:16:20,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1257825762, now seen corresponding path program 1 times [2022-11-23 02:16:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:20,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735879722] [2022-11-23 02:16:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:20,891 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-23 02:16:20,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:20,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735879722] [2022-11-23 02:16:20,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735879722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:20,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:20,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:16:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50759366] [2022-11-23 02:16:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:20,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:16:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:16:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:16:20,896 INFO L87 Difference]: Start difference. First operand 141 states and 184 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-23 02:16:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:21,096 INFO L93 Difference]: Finished difference Result 313 states and 407 transitions. [2022-11-23 02:16:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:16:21,097 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-23 02:16:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:21,099 INFO L225 Difference]: With dead ends: 313 [2022-11-23 02:16:21,099 INFO L226 Difference]: Without dead ends: 175 [2022-11-23 02:16:21,100 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-23 02:16:21,102 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 145 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:21,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 399 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:16:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-23 02:16:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2022-11-23 02:16:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.5354330708661417) internal successors, (195), 148 states have internal predecessors, (195), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2022-11-23 02:16:21,124 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 14 [2022-11-23 02:16:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:21,124 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2022-11-23 02:16:21,125 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-23 02:16:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2022-11-23 02:16:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 02:16:21,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:21,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:21,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:16:21,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1301603374, now seen corresponding path program 1 times [2022-11-23 02:16:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311636075] [2022-11-23 02:16:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,246 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-23 02:16:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:21,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311636075] [2022-11-23 02:16:21,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311636075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:21,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:21,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:16:21,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659856917] [2022-11-23 02:16:21,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:16:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:16:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:16:21,252 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-23 02:16:21,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:21,326 INFO L93 Difference]: Finished difference Result 312 states and 408 transitions. [2022-11-23 02:16:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:16:21,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-23 02:16:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:21,328 INFO L225 Difference]: With dead ends: 312 [2022-11-23 02:16:21,328 INFO L226 Difference]: Without dead ends: 160 [2022-11-23 02:16:21,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:16:21,331 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:21,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 327 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:16:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-23 02:16:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-23 02:16:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.5190839694656488) internal successors, (199), 152 states have internal predecessors, (199), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2022-11-23 02:16:21,345 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 15 [2022-11-23 02:16:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:21,346 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2022-11-23 02:16:21,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-23 02:16:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2022-11-23 02:16:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 02:16:21,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:21,348 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-23 02:16:21,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:16:21,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1755668256, now seen corresponding path program 1 times [2022-11-23 02:16:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702626984] [2022-11-23 02:16:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 02:16:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:21,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702626984] [2022-11-23 02:16:21,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702626984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:21,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:21,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:16:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313793150] [2022-11-23 02:16:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:21,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:16:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:16:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:16:21,404 INFO L87 Difference]: Start difference. First operand 160 states and 207 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, (3), 1 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-23 02:16:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:21,445 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2022-11-23 02:16:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:16:21,445 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, (3), 1 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-23 02:16:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:21,447 INFO L225 Difference]: With dead ends: 166 [2022-11-23 02:16:21,447 INFO L226 Difference]: Without dead ends: 165 [2022-11-23 02:16:21,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-23 02:16:21,449 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:21,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:16:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-23 02:16:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2022-11-23 02:16:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 150 states have internal predecessors, (196), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2022-11-23 02:16:21,464 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 23 [2022-11-23 02:16:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:21,464 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2022-11-23 02:16:21,465 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, (3), 1 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-23 02:16:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2022-11-23 02:16:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 02:16:21,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:21,466 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:21,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:16:21,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash -319173109, now seen corresponding path program 1 times [2022-11-23 02:16:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784605200] [2022-11-23 02:16:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,556 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-23 02:16:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:21,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784605200] [2022-11-23 02:16:21,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784605200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:21,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:21,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:16:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750974669] [2022-11-23 02:16:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:21,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:16:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:16:21,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:16:21,561 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-23 02:16:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:21,617 INFO L93 Difference]: Finished difference Result 269 states and 334 transitions. [2022-11-23 02:16:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:16:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-11-23 02:16:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:21,619 INFO L225 Difference]: With dead ends: 269 [2022-11-23 02:16:21,619 INFO L226 Difference]: Without dead ends: 146 [2022-11-23 02:16:21,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-23 02:16:21,621 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 41 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:21,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 327 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:16:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-23 02:16:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-11-23 02:16:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 132 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2022-11-23 02:16:21,632 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 178 transitions. Word has length 22 [2022-11-23 02:16:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:21,633 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 178 transitions. [2022-11-23 02:16:21,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-23 02:16:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 178 transitions. [2022-11-23 02:16:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 02:16:21,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:21,634 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:21,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:16:21,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1320323335, now seen corresponding path program 1 times [2022-11-23 02:16:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:21,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955991067] [2022-11-23 02:16:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,719 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-23 02:16:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955991067] [2022-11-23 02:16:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955991067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:21,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:21,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:16:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208832636] [2022-11-23 02:16:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:21,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:16:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:16:21,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:16:21,722 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-23 02:16:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:21,846 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2022-11-23 02:16:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:16:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 22 [2022-11-23 02:16:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:21,848 INFO L225 Difference]: With dead ends: 149 [2022-11-23 02:16:21,848 INFO L226 Difference]: Without dead ends: 146 [2022-11-23 02:16:21,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-23 02:16:21,852 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 69 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:21,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 398 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:16:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-23 02:16:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-11-23 02:16:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 132 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2022-11-23 02:16:21,875 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 22 [2022-11-23 02:16:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:21,876 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2022-11-23 02:16:21,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-23 02:16:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2022-11-23 02:16:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 02:16:21,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:21,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:16:21,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:21,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash 807932041, now seen corresponding path program 1 times [2022-11-23 02:16:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:21,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603636869] [2022-11-23 02:16:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 02:16:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603636869] [2022-11-23 02:16:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603636869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:21,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:21,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:16:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664921097] [2022-11-23 02:16:21,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:21,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:16:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:16:21,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:16:21,979 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-23 02:16:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:22,036 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2022-11-23 02:16:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:16:22,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 26 [2022-11-23 02:16:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:22,039 INFO L225 Difference]: With dead ends: 161 [2022-11-23 02:16:22,039 INFO L226 Difference]: Without dead ends: 158 [2022-11-23 02:16:22,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-23 02:16:22,040 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 25 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:22,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 215 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:16:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-23 02:16:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2022-11-23 02:16:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 137 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2022-11-23 02:16:22,050 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 26 [2022-11-23 02:16:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:22,051 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2022-11-23 02:16:22,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-23 02:16:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2022-11-23 02:16:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 02:16:22,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:22,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:22,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:16:22,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 800615145, now seen corresponding path program 1 times [2022-11-23 02:16:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:22,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184059248] [2022-11-23 02:16:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:22,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184059248] [2022-11-23 02:16:22,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184059248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:16:22,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653485999] [2022-11-23 02:16:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:22,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:16:22,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:16:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:22,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:16:22,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:16:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:22,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:16:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:22,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653485999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:16:22,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:16:22,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-23 02:16:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485568226] [2022-11-23 02:16:22,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:16:22,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 02:16:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 02:16:22,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-11-23 02:16:22,727 INFO L87 Difference]: Start difference. First operand 145 states and 178 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 02:16:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:23,221 INFO L93 Difference]: Finished difference Result 497 states and 638 transitions. [2022-11-23 02:16:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 02:16:23,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-11-23 02:16:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:23,230 INFO L225 Difference]: With dead ends: 497 [2022-11-23 02:16:23,231 INFO L226 Difference]: Without dead ends: 393 [2022-11-23 02:16:23,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2022-11-23 02:16:23,234 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 382 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:23,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 651 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:16:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-11-23 02:16:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 165. [2022-11-23 02:16:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 157 states have internal predecessors, (194), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-11-23 02:16:23,263 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 37 [2022-11-23 02:16:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:23,264 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-11-23 02:16:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 02:16:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-11-23 02:16:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 02:16:23,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:23,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:23,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:16:23,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:23,475 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash -645266335, now seen corresponding path program 1 times [2022-11-23 02:16:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:23,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307985149] [2022-11-23 02:16:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:16:23,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:23,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307985149] [2022-11-23 02:16:23,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307985149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:23,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:23,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:16:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717787600] [2022-11-23 02:16:23,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:16:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:16:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:16:23,572 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-23 02:16:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:23,674 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2022-11-23 02:16:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:16:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2022-11-23 02:16:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:23,678 INFO L225 Difference]: With dead ends: 216 [2022-11-23 02:16:23,678 INFO L226 Difference]: Without dead ends: 213 [2022-11-23 02:16:23,678 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-23 02:16:23,681 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 149 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:23,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 326 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:16:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-23 02:16:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 192. [2022-11-23 02:16:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 164 states have (on average 1.4268292682926829) internal successors, (234), 183 states have internal predecessors, (234), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2022-11-23 02:16:23,693 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 39 [2022-11-23 02:16:23,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:23,695 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2022-11-23 02:16:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-23 02:16:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-11-23 02:16:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 02:16:23,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:23,699 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:16:23,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -673893691, now seen corresponding path program 1 times [2022-11-23 02:16:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:23,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547025289] [2022-11-23 02:16:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:16:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:23,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547025289] [2022-11-23 02:16:23,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547025289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:23,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:23,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:16:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137076281] [2022-11-23 02:16:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:23,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:16:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:23,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:16:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:16:23,790 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-23 02:16:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:23,892 INFO L93 Difference]: Finished difference Result 214 states and 265 transitions. [2022-11-23 02:16:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:16:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2022-11-23 02:16:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:23,896 INFO L225 Difference]: With dead ends: 214 [2022-11-23 02:16:23,897 INFO L226 Difference]: Without dead ends: 211 [2022-11-23 02:16:23,897 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-23 02:16:23,898 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:23,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 314 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:16:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-23 02:16:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2022-11-23 02:16:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.409356725146199) internal successors, (241), 189 states have internal predecessors, (241), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2022-11-23 02:16:23,936 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 39 [2022-11-23 02:16:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:23,936 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2022-11-23 02:16:23,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-23 02:16:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-11-23 02:16:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 02:16:23,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:23,938 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:23,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:16:23,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:23,939 INFO L85 PathProgramCache]: Analyzing trace with hash 161766024, now seen corresponding path program 1 times [2022-11-23 02:16:23,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:23,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133207719] [2022-11-23 02:16:23,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:23,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:24,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133207719] [2022-11-23 02:16:24,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133207719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:24,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:24,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:16:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016363885] [2022-11-23 02:16:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:24,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:16:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:24,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:16:24,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:16:24,086 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:16:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:24,204 INFO L93 Difference]: Finished difference Result 424 states and 537 transitions. [2022-11-23 02:16:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:16:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-23 02:16:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:24,206 INFO L225 Difference]: With dead ends: 424 [2022-11-23 02:16:24,207 INFO L226 Difference]: Without dead ends: 281 [2022-11-23 02:16:24,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:16:24,208 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:24,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 214 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:16:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-23 02:16:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 198. [2022-11-23 02:16:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.4035087719298245) internal successors, (240), 189 states have internal predecessors, (240), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2022-11-23 02:16:24,227 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 44 [2022-11-23 02:16:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:24,228 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2022-11-23 02:16:24,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:16:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2022-11-23 02:16:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 02:16:24,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:24,229 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:24,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:16:24,230 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1469984120, now seen corresponding path program 1 times [2022-11-23 02:16:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:24,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618747939] [2022-11-23 02:16:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618747939] [2022-11-23 02:16:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618747939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:16:24,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197971979] [2022-11-23 02:16:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:24,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:16:24,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 02:16:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:24,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:16:24,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:16:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:24,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:16:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:24,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197971979] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:16:24,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:16:24,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-23 02:16:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111335515] [2022-11-23 02:16:24,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:16:24,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 02:16:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 02:16:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:16:24,739 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:16:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:25,156 INFO L93 Difference]: Finished difference Result 526 states and 665 transitions. [2022-11-23 02:16:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 02:16:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-11-23 02:16:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:25,159 INFO L225 Difference]: With dead ends: 526 [2022-11-23 02:16:25,159 INFO L226 Difference]: Without dead ends: 369 [2022-11-23 02:16:25,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-11-23 02:16:25,160 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 274 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:25,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 633 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:16:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-23 02:16:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 188. [2022-11-23 02:16:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 179 states have internal predecessors, (223), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2022-11-23 02:16:25,188 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 49 [2022-11-23 02:16:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:25,188 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2022-11-23 02:16:25,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:16:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2022-11-23 02:16:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 02:16:25,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:25,189 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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] [2022-11-23 02:16:25,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:16:25,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:25,396 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1370409216, now seen corresponding path program 1 times [2022-11-23 02:16:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794722463] [2022-11-23 02:16:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:25,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794722463] [2022-11-23 02:16:25,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794722463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:16:25,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166552318] [2022-11-23 02:16:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:25,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:25,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:16:25,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 02:16:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:25,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:16:25,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:16:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:25,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:16:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:26,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166552318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:16:26,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:16:26,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-23 02:16:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328841069] [2022-11-23 02:16:26,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:16:26,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 02:16:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 02:16:26,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2022-11-23 02:16:26,325 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 02:16:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:27,306 INFO L93 Difference]: Finished difference Result 1144 states and 1479 transitions. [2022-11-23 02:16:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 02:16:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-11-23 02:16:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:27,311 INFO L225 Difference]: With dead ends: 1144 [2022-11-23 02:16:27,312 INFO L226 Difference]: Without dead ends: 1007 [2022-11-23 02:16:27,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2022-11-23 02:16:27,314 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 951 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:27,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 583 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:16:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-11-23 02:16:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 238. [2022-11-23 02:16:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.3459715639810426) internal successors, (284), 229 states have internal predecessors, (284), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2022-11-23 02:16:27,349 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 62 [2022-11-23 02:16:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:27,351 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2022-11-23 02:16:27,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 02:16:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2022-11-23 02:16:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-23 02:16:27,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:27,353 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:27,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:16:27,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 02:16:27,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash 680252040, now seen corresponding path program 2 times [2022-11-23 02:16:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:27,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396101087] [2022-11-23 02:16:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:27,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:27,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396101087] [2022-11-23 02:16:27,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396101087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:16:27,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607033097] [2022-11-23 02:16:27,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:16:27,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:27,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:27,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:16:27,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 02:16:28,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:16:28,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:16:28,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 02:16:28,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:16:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:28,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:16:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:28,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607033097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:16:28,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:16:28,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-23 02:16:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684822553] [2022-11-23 02:16:28,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:16:28,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 02:16:28,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 02:16:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2022-11-23 02:16:28,590 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:16:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:44,604 INFO L93 Difference]: Finished difference Result 726 states and 917 transitions. [2022-11-23 02:16:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 02:16:44,605 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2022-11-23 02:16:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:44,608 INFO L225 Difference]: With dead ends: 726 [2022-11-23 02:16:44,608 INFO L226 Difference]: Without dead ends: 569 [2022-11-23 02:16:44,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=500, Invalid=902, Unknown=4, NotChecked=0, Total=1406 [2022-11-23 02:16:44,610 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 478 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:44,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1618 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 02:16:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-23 02:16:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 228. [2022-11-23 02:16:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.308457711442786) internal successors, (263), 219 states have internal predecessors, (263), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 271 transitions. [2022-11-23 02:16:44,636 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 271 transitions. Word has length 69 [2022-11-23 02:16:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:44,636 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 271 transitions. [2022-11-23 02:16:44,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:16:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 271 transitions. [2022-11-23 02:16:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-23 02:16:44,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:44,638 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 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] [2022-11-23 02:16:44,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:16:44,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 02:16:44,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1831155456, now seen corresponding path program 2 times [2022-11-23 02:16:44,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:44,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242972282] [2022-11-23 02:16:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:44,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:45,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:45,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242972282] [2022-11-23 02:16:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242972282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:16:45,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660344538] [2022-11-23 02:16:45,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:16:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:45,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:16:45,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 02:16:45,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:16:45,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:16:45,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 02:16:45,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:16:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:46,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:16:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660344538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:16:46,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:16:46,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2022-11-23 02:16:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236425241] [2022-11-23 02:16:46,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:16:46,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 02:16:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:16:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 02:16:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 02:16:46,980 INFO L87 Difference]: Start difference. First operand 228 states and 271 transitions. Second operand has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 02:16:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:16:49,792 INFO L93 Difference]: Finished difference Result 2032 states and 2647 transitions. [2022-11-23 02:16:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-23 02:16:49,793 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2022-11-23 02:16:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:16:49,800 INFO L225 Difference]: With dead ends: 2032 [2022-11-23 02:16:49,801 INFO L226 Difference]: Without dead ends: 1895 [2022-11-23 02:16:49,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2022-11-23 02:16:49,806 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2475 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:16:49,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2475 Valid, 1362 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 02:16:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-11-23 02:16:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 318. [2022-11-23 02:16:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 291 states have (on average 1.2783505154639174) internal successors, (372), 309 states have internal predecessors, (372), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:16:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 380 transitions. [2022-11-23 02:16:49,871 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 380 transitions. Word has length 102 [2022-11-23 02:16:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:16:49,872 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 380 transitions. [2022-11-23 02:16:49,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 02:16:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 380 transitions. [2022-11-23 02:16:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-23 02:16:49,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:16:49,879 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:49,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:16:50,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 02:16:50,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:16:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2111820424, now seen corresponding path program 3 times [2022-11-23 02:16:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:16:50,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466256041] [2022-11-23 02:16:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:16:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:16:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:16:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 02:16:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:16:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:16:50,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:16:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466256041] [2022-11-23 02:16:50,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466256041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:16:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755806415] [2022-11-23 02:16:50,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:16:50,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:16:50,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:51,000 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:16:51,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 02:17:12,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-11-23 02:17:12,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:17:12,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 02:17:12,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:17:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:17:13,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:17:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:17:14,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755806415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:17:14,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:17:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2022-11-23 02:17:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256278913] [2022-11-23 02:17:14,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:17:14,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-23 02:17:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:14,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-23 02:17:14,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1735, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 02:17:14,208 INFO L87 Difference]: Start difference. First operand 318 states and 380 transitions. Second operand has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:17:59,033 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 48 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:18:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:01,057 INFO L93 Difference]: Finished difference Result 1046 states and 1320 transitions. [2022-11-23 02:18:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-23 02:18:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 109 [2022-11-23 02:18:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:01,066 INFO L225 Difference]: With dead ends: 1046 [2022-11-23 02:18:01,066 INFO L226 Difference]: Without dead ends: 889 [2022-11-23 02:18:01,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=1620, Invalid=3630, Unknown=6, NotChecked=0, Total=5256 [2022-11-23 02:18:01,069 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1219 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 3813 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:01,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 3813 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 02:18:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-11-23 02:18:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 318. [2022-11-23 02:18:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 291 states have (on average 1.2439862542955327) internal successors, (362), 309 states have internal predecessors, (362), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 370 transitions. [2022-11-23 02:18:01,117 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 370 transitions. Word has length 109 [2022-11-23 02:18:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:01,117 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 370 transitions. [2022-11-23 02:18:01,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 370 transitions. [2022-11-23 02:18:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-23 02:18:01,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:01,120 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:01,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:01,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 02:18:01,328 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 803787400, now seen corresponding path program 4 times [2022-11-23 02:18:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:01,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574466862] [2022-11-23 02:18:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:18:01,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:18:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:18:01,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:18:01,438 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:18:01,439 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2022-11-23 02:18:01,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2022-11-23 02:18:01,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2022-11-23 02:18:01,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2022-11-23 02:18:01,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2022-11-23 02:18:01,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2022-11-23 02:18:01,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2022-11-23 02:18:01,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2022-11-23 02:18:01,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2022-11-23 02:18:01,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2022-11-23 02:18:01,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2022-11-23 02:18:01,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2022-11-23 02:18:01,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2022-11-23 02:18:01,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2022-11-23 02:18:01,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2022-11-23 02:18:01,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2022-11-23 02:18:01,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2022-11-23 02:18:01,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2022-11-23 02:18:01,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2022-11-23 02:18:01,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2022-11-23 02:18:01,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2022-11-23 02:18:01,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2022-11-23 02:18:01,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2022-11-23 02:18:01,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2022-11-23 02:18:01,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 02:18:01,455 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:01,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:18:01,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:18:01 BoogieIcfgContainer [2022-11-23 02:18:01,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:18:01,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:18:01,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:18:01,584 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:18:01,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:19" (3/4) ... [2022-11-23 02:18:01,588 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:18:01,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:18:01,588 INFO L158 Benchmark]: Toolchain (without parser) took 102882.31ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 125.0MB in the beginning and 104.7MB in the end (delta: 20.4MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2022-11-23 02:18:01,589 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory was 75.0MB in the beginning and 74.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:18:01,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.96ms. Allocated memory is still 157.3MB. Free memory was 125.0MB in the beginning and 111.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 02:18:01,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.22ms. Allocated memory is still 157.3MB. Free memory was 111.1MB in the beginning and 108.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:18:01,591 INFO L158 Benchmark]: Boogie Preprocessor took 55.65ms. Allocated memory is still 157.3MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:18:01,591 INFO L158 Benchmark]: RCFGBuilder took 803.63ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 83.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 02:18:01,592 INFO L158 Benchmark]: TraceAbstraction took 101602.04ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 82.4MB in the beginning and 104.7MB in the end (delta: -22.3MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2022-11-23 02:18:01,593 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 272.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:18:01,598 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.26ms. Allocated memory is still 130.0MB. Free memory was 75.0MB in the beginning and 74.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.96ms. Allocated memory is still 157.3MB. Free memory was 125.0MB in the beginning and 111.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.22ms. Allocated memory is still 157.3MB. Free memory was 111.1MB in the beginning and 108.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.65ms. Allocated memory is still 157.3MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 803.63ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 83.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 101602.04ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 82.4MB in the beginning and 104.7MB in the end (delta: -22.3MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 272.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 77]: 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. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [__retres4=0, e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L80] return (__retres4); VAL [\result=0, __retres4=0, e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L29] COND FALSE !(! m) VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L35] COND TRUE m < 1U << 24U VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-24, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND FALSE !(m < 1U << 24U) VAL [e=-24, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L76] m = m & ~ (1U << 24U) VAL [e=-24, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L77] EXPR e + 128 VAL [e=-24, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L77] EXPR (e + 128) << 24U VAL [e=-24, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [__retres4=1744830464, e=-24, m=0, res=1744830464, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L80] return (__retres4); VAL [\result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L29] COND FALSE !(! m) VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L57] COND TRUE 1 VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L76] m = m & ~ (1U << 24U) VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L77] EXPR e + 128 VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L77] (e + 128) << 24U VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] - 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: 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: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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 3 procedures, 121 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 101.4s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 68.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6576 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6570 mSDsluCounter, 11804 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9909 mSDsCounter, 1533 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6211 IncrementalHoareTripleChecker+Invalid, 7744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1533 mSolverCounterUnsat, 1895 mSDtfsCounter, 6211 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4058 ImplicationChecksByTransitivity, 63.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=15, InterpolantAutomatonStates: 252, 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, 16 MinimizatonAttempts, 3849 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 21.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1268 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1509 ConstructedInterpolants, 0 QuantifiedInterpolants, 7845 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 304/3646 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-23 02:18:01,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/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 Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS --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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- 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-4e7fbc6 [2022-11-23 02:18:04,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:18:04,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:18:04,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:18:04,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:18:04,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:18:04,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:18:04,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:18:04,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:18:04,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:18:04,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:18:04,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:18:04,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:18:04,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:18:04,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:18:04,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:18:04,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:18:04,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:18:04,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:18:04,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:18:04,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:18:04,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:18:04,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:18:04,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:18:04,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:18:04,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:18:04,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:18:04,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:18:04,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:18:04,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:18:04,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:18:04,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:18:04,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:18:04,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:18:04,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:18:04,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:18:04,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:18:04,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:18:04,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:18:04,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:18:04,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:18:04,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2022-11-23 02:18:04,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:18:04,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:18:04,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:18:04,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:18:04,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:18:04,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:18:04,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:18:04,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:18:04,302 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:18:04,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:18:04,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:18:04,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:18:04,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:18:04,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:18:04,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:18:04,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:18:04,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:18:04,305 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:18:04,306 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 02:18:04,306 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 02:18:04,306 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 02:18:04,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:18:04,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:18:04,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:18:04,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:18:04,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:18:04,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:18:04,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:18:04,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:04,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:18:04,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:18:04,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:18:04,310 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 02:18:04,310 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 02:18:04,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:18:04,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:18:04,311 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:18:04,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:18:04,312 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 02:18:04,312 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/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_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2022-11-23 02:18:04,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:18:04,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:18:04,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:18:04,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:18:04,773 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:18:04,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2022-11-23 02:18:07,859 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:18:08,128 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:18:08,129 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2022-11-23 02:18:08,136 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data/0f5da5b42/1a1a50752c2d41b2a00476b175b8cd30/FLAG94c3b499f [2022-11-23 02:18:08,151 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/data/0f5da5b42/1a1a50752c2d41b2a00476b175b8cd30 [2022-11-23 02:18:08,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:18:08,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:18:08,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:08,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:18:08,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:18:08,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2722eef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08, skipping insertion in model container [2022-11-23 02:18:08,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:18:08,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:18:08,431 WARN L237 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_1f67bd50-82d6-4db8-9d49-720f9af82aab/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c[727,740] [2022-11-23 02:18:08,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:08,541 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:18:08,558 WARN L237 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_1f67bd50-82d6-4db8-9d49-720f9af82aab/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c[727,740] [2022-11-23 02:18:08,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:08,639 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:18:08,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08 WrapperNode [2022-11-23 02:18:08,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:08,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:08,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:18:08,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:18:08,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,710 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2022-11-23 02:18:08,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:08,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:18:08,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:18:08,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:18:08,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,804 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:18:08,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:18:08,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:18:08,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:18:08,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (1/1) ... [2022-11-23 02:18:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:08,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:08,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:18:08,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:18:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:18:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 02:18:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-11-23 02:18:08,918 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-11-23 02:18:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:18:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:18:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 02:18:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 02:18:09,043 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:18:09,046 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:18:09,539 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:18:09,547 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:18:09,547 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 02:18:09,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:09 BoogieIcfgContainer [2022-11-23 02:18:09,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:18:09,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:18:09,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:18:09,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:18:09,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:08" (1/3) ... [2022-11-23 02:18:09,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69826861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:09, skipping insertion in model container [2022-11-23 02:18:09,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:08" (2/3) ... [2022-11-23 02:18:09,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69826861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:09, skipping insertion in model container [2022-11-23 02:18:09,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:09" (3/3) ... [2022-11-23 02:18:09,559 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2022-11-23 02:18:09,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:18:09,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-11-23 02:18:09,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:18:09,656 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2796899c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:18:09,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-23 02:18:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 91 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:18:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 02:18:09,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:09,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:09,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 638430033, now seen corresponding path program 1 times [2022-11-23 02:18:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:09,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171452680] [2022-11-23 02:18:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:09,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:09,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:09,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 02:18:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:09,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 02:18:09,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:09,852 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-23 02:18:09,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:09,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:09,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171452680] [2022-11-23 02:18:09,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171452680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:09,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:09,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431275048] [2022-11-23 02:18:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:09,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:18:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:18:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:18:09,918 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 91 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 8.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-23 02:18:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:09,953 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2022-11-23 02:18:09,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:18:09,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.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-23 02:18:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:09,964 INFO L225 Difference]: With dead ends: 183 [2022-11-23 02:18:09,964 INFO L226 Difference]: Without dead ends: 69 [2022-11-23 02:18:09,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-23 02:18:09,971 INFO L413 NwaCegarLoop]: 108 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, 108 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-23 02:18:09,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-23 02:18:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-23 02:18:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 63 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-11-23 02:18:10,042 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 9 [2022-11-23 02:18:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:10,044 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-11-23 02:18:10,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.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-23 02:18:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-11-23 02:18:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 02:18:10,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:10,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:10,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-23 02:18:10,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:10,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 637488767, now seen corresponding path program 1 times [2022-11-23 02:18:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:10,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683177593] [2022-11-23 02:18:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:10,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:10,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:10,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 02:18:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:18:10,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:10,340 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-23 02:18:10,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:10,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:10,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683177593] [2022-11-23 02:18:10,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683177593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:10,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:10,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178756971] [2022-11-23 02:18:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:10,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:18:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:18:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:18:10,345 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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-23 02:18:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:10,417 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-11-23 02:18:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:18:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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-23 02:18:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:10,420 INFO L225 Difference]: With dead ends: 143 [2022-11-23 02:18:10,421 INFO L226 Difference]: Without dead ends: 77 [2022-11-23 02:18:10,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-23 02:18:10,423 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:10,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-23 02:18:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-23 02:18:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 67 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-23 02:18:10,436 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 9 [2022-11-23 02:18:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:10,437 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-23 02:18:10,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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-23 02:18:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-23 02:18:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 02:18:10,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:10,438 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:10,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:10,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1499029201, now seen corresponding path program 1 times [2022-11-23 02:18:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:10,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106605564] [2022-11-23 02:18:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:10,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:10,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:10,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:10,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 02:18:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:10,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:18:10,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:10,753 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-23 02:18:10,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:10,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106605564] [2022-11-23 02:18:10,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106605564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:10,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:10,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:18:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013254899] [2022-11-23 02:18:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:10,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:18:10,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:18:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:18:10,757 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 02:18:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:10,888 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2022-11-23 02:18:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:18:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 02:18:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:10,890 INFO L225 Difference]: With dead ends: 185 [2022-11-23 02:18:10,891 INFO L226 Difference]: Without dead ends: 121 [2022-11-23 02:18:10,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-23 02:18:10,893 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:10,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-23 02:18:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2022-11-23 02:18:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 102 states have internal predecessors, (123), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2022-11-23 02:18:10,907 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 16 [2022-11-23 02:18:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:10,908 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2022-11-23 02:18:10,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 02:18:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2022-11-23 02:18:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 02:18:10,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:10,909 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:10,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:11,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:11,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1438968756, now seen corresponding path program 1 times [2022-11-23 02:18:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:11,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080280154] [2022-11-23 02:18:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:11,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:11,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:11,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 02:18:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:11,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:18:11,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:11,212 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-23 02:18:11,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:11,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:11,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080280154] [2022-11-23 02:18:11,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080280154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:11,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:11,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447380921] [2022-11-23 02:18:11,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:11,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:18:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:18:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:18:11,216 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-23 02:18:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:11,284 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-11-23 02:18:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:18:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-11-23 02:18:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:11,286 INFO L225 Difference]: With dead ends: 189 [2022-11-23 02:18:11,286 INFO L226 Difference]: Without dead ends: 100 [2022-11-23 02:18:11,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-23 02:18:11,288 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:11,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 217 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-23 02:18:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-11-23 02:18:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 86 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2022-11-23 02:18:11,300 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 21 [2022-11-23 02:18:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:11,300 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-11-23 02:18:11,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-23 02:18:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2022-11-23 02:18:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 02:18:11,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:11,302 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:11,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:11,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:11,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1597331601, now seen corresponding path program 1 times [2022-11-23 02:18:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:11,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610872942] [2022-11-23 02:18:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:11,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:11,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 02:18:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:11,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:18:11,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:11,648 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-23 02:18:11,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:11,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:11,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610872942] [2022-11-23 02:18:11,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610872942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:11,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:11,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:18:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753104570] [2022-11-23 02:18:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:11,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:18:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:18:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:18:11,652 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-23 02:18:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:11,750 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2022-11-23 02:18:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:18:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2022-11-23 02:18:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:11,752 INFO L225 Difference]: With dead ends: 182 [2022-11-23 02:18:11,753 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 02:18:11,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-23 02:18:11,758 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 44 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:11,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 286 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 02:18:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-11-23 02:18:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 88 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-11-23 02:18:11,769 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 21 [2022-11-23 02:18:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:11,770 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-11-23 02:18:11,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-23 02:18:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-11-23 02:18:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 02:18:11,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:11,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:11,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:11,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:11,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1597440705, now seen corresponding path program 1 times [2022-11-23 02:18:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855268431] [2022-11-23 02:18:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:11,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:11,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 02:18:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:12,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:18:12,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:12,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:12,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:12,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855268431] [2022-11-23 02:18:12,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855268431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:12,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:12,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-23 02:18:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115351108] [2022-11-23 02:18:12,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:12,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:18:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:18:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:18:12,311 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:13,066 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-11-23 02:18:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:18:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-23 02:18:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:13,069 INFO L225 Difference]: With dead ends: 209 [2022-11-23 02:18:13,069 INFO L226 Difference]: Without dead ends: 142 [2022-11-23 02:18:13,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:18:13,071 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 199 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:13,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 287 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:18:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-23 02:18:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 97. [2022-11-23 02:18:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 89 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-11-23 02:18:13,087 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 21 [2022-11-23 02:18:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:13,087 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-11-23 02:18:13,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-11-23 02:18:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 02:18:13,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:13,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:13,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:13,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:13,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:13,301 INFO L85 PathProgramCache]: Analyzing trace with hash -988850849, now seen corresponding path program 1 times [2022-11-23 02:18:13,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:13,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145114345] [2022-11-23 02:18:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:13,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:13,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:13,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 02:18:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:13,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:18:13,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:13,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:13,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:13,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145114345] [2022-11-23 02:18:13,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145114345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:13,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:13,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 02:18:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317803514] [2022-11-23 02:18:13,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:13,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:18:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:13,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:18:13,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:18:13,578 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:13,926 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2022-11-23 02:18:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:18:13,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-11-23 02:18:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:13,927 INFO L225 Difference]: With dead ends: 209 [2022-11-23 02:18:13,928 INFO L226 Difference]: Without dead ends: 137 [2022-11-23 02:18:13,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-11-23 02:18:13,929 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 170 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:13,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 417 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:13,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-23 02:18:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2022-11-23 02:18:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.305263157894737) internal successors, (124), 107 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-11-23 02:18:13,957 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 26 [2022-11-23 02:18:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:13,959 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-11-23 02:18:13,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-11-23 02:18:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 02:18:13,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:13,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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-23 02:18:13,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:14,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 411281957, now seen corresponding path program 1 times [2022-11-23 02:18:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:14,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914677819] [2022-11-23 02:18:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:14,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:14,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:14,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 02:18:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:14,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:18:14,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:18:14,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:18:14,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:14,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914677819] [2022-11-23 02:18:14,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914677819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:14,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:14,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 02:18:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279677978] [2022-11-23 02:18:14,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:14,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:18:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:14,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:18:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:18:14,695 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:15,628 INFO L93 Difference]: Finished difference Result 299 states and 358 transitions. [2022-11-23 02:18:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 02:18:15,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-11-23 02:18:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:15,631 INFO L225 Difference]: With dead ends: 299 [2022-11-23 02:18:15,631 INFO L226 Difference]: Without dead ends: 230 [2022-11-23 02:18:15,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:18:15,633 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 186 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:15,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 440 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 02:18:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-23 02:18:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 117. [2022-11-23 02:18:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.268041237113402) internal successors, (123), 109 states have internal predecessors, (123), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-11-23 02:18:15,675 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 38 [2022-11-23 02:18:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:15,679 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-11-23 02:18:15,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-11-23 02:18:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 02:18:15,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:15,681 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:15,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:15,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:15,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash 472901983, now seen corresponding path program 2 times [2022-11-23 02:18:15,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:15,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659027266] [2022-11-23 02:18:15,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:18:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:15,895 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:15,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 02:18:15,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:18:15,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:18:15,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 02:18:15,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:16,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:16,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659027266] [2022-11-23 02:18:16,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659027266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:16,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:16,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-23 02:18:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236117726] [2022-11-23 02:18:16,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:16,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 02:18:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 02:18:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-11-23 02:18:16,468 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:17,454 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2022-11-23 02:18:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 02:18:17,455 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-23 02:18:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:17,457 INFO L225 Difference]: With dead ends: 267 [2022-11-23 02:18:17,457 INFO L226 Difference]: Without dead ends: 195 [2022-11-23 02:18:17,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 02:18:17,459 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 300 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:17,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1069 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:18:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-23 02:18:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 155. [2022-11-23 02:18:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 147 states have internal predecessors, (168), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2022-11-23 02:18:17,479 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 46 [2022-11-23 02:18:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:17,479 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2022-11-23 02:18:17,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2022-11-23 02:18:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:18:17,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:17,481 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:17,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:17,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:17,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2137407013, now seen corresponding path program 2 times [2022-11-23 02:18:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:17,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619557928] [2022-11-23 02:18:17,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:18:17,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:17,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:17,696 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:17,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 02:18:17,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:18:17,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:18:17,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 02:18:17,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-11-23 02:18:17,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:17,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619557928] [2022-11-23 02:18:17,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619557928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:17,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:17,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:18:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886047704] [2022-11-23 02:18:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:17,751 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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-23 02:18:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:17,800 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2022-11-23 02:18:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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 58 [2022-11-23 02:18:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:17,803 INFO L225 Difference]: With dead ends: 161 [2022-11-23 02:18:17,803 INFO L226 Difference]: Without dead ends: 160 [2022-11-23 02:18:17,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-23 02:18:17,804 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:17,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-23 02:18:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-11-23 02:18:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.237037037037037) internal successors, (167), 146 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2022-11-23 02:18:17,841 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 58 [2022-11-23 02:18:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:17,841 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2022-11-23 02:18:17,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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-23 02:18:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2022-11-23 02:18:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:18:17,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:17,843 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:17,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:18,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:18,054 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2137474539, now seen corresponding path program 1 times [2022-11-23 02:18:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:18,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882933661] [2022-11-23 02:18:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:18,056 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:18,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 02:18:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:18,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:18:18,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:18:18,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:18:19,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:19,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882933661] [2022-11-23 02:18:19,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882933661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:19,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:19,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-23 02:18:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625579952] [2022-11-23 02:18:19,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:19,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 02:18:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:19,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 02:18:19,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-23 02:18:19,177 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:22,426 INFO L93 Difference]: Finished difference Result 476 states and 583 transitions. [2022-11-23 02:18:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 02:18:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-11-23 02:18:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:22,430 INFO L225 Difference]: With dead ends: 476 [2022-11-23 02:18:22,430 INFO L226 Difference]: Without dead ends: 408 [2022-11-23 02:18:22,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2022-11-23 02:18:22,431 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 703 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:22,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 844 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 02:18:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-23 02:18:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 156. [2022-11-23 02:18:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 148 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2022-11-23 02:18:22,460 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 58 [2022-11-23 02:18:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:22,461 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2022-11-23 02:18:22,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2022-11-23 02:18:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-23 02:18:22,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:22,462 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:22,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:22,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:22,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1631261023, now seen corresponding path program 3 times [2022-11-23 02:18:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:22,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016373643] [2022-11-23 02:18:22,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:18:22,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:22,678 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:22,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 02:18:22,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-11-23 02:18:22,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:18:22,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 02:18:22,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:23,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:24,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:24,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016373643] [2022-11-23 02:18:24,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016373643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:24,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:24,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2022-11-23 02:18:24,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436842272] [2022-11-23 02:18:24,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:24,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 02:18:24,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 02:18:24,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 02:18:24,618 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:33,432 INFO L93 Difference]: Finished difference Result 556 states and 657 transitions. [2022-11-23 02:18:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-23 02:18:33,433 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-11-23 02:18:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:33,435 INFO L225 Difference]: With dead ends: 556 [2022-11-23 02:18:33,436 INFO L226 Difference]: Without dead ends: 485 [2022-11-23 02:18:33,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2022-11-23 02:18:33,440 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 943 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:33,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 3620 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 02:18:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-23 02:18:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 234. [2022-11-23 02:18:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 215 states have (on average 1.1906976744186046) internal successors, (256), 226 states have internal predecessors, (256), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2022-11-23 02:18:33,472 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 86 [2022-11-23 02:18:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:33,472 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2022-11-23 02:18:33,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:18:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2022-11-23 02:18:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-23 02:18:33,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:33,474 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:33,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:33,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:33,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 83258859, now seen corresponding path program 2 times [2022-11-23 02:18:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:33,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680236035] [2022-11-23 02:18:33,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:18:33,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:33,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:33,691 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:33,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 02:18:33,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:18:33,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:18:33,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 02:18:33,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:18:34,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:18:37,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680236035] [2022-11-23 02:18:37,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680236035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:37,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:37,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-11-23 02:18:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262216630] [2022-11-23 02:18:37,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:37,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 02:18:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 02:18:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 02:18:37,031 INFO L87 Difference]: Start difference. First operand 234 states and 264 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:49,345 INFO L93 Difference]: Finished difference Result 845 states and 1053 transitions. [2022-11-23 02:18:49,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-23 02:18:49,346 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2022-11-23 02:18:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:49,349 INFO L225 Difference]: With dead ends: 845 [2022-11-23 02:18:49,349 INFO L226 Difference]: Without dead ends: 777 [2022-11-23 02:18:49,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2022-11-23 02:18:49,352 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1387 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 4267 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 4267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:49,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 2421 Invalid, 4679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4267 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-23 02:18:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-11-23 02:18:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 236. [2022-11-23 02:18:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 217 states have (on average 1.119815668202765) internal successors, (243), 228 states have internal predecessors, (243), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:18:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 251 transitions. [2022-11-23 02:18:49,405 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 251 transitions. Word has length 98 [2022-11-23 02:18:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:49,405 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 251 transitions. [2022-11-23 02:18:49,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:18:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 251 transitions. [2022-11-23 02:18:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-23 02:18:49,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:49,407 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:49,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-23 02:18:49,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:49,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:18:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash -598490273, now seen corresponding path program 4 times [2022-11-23 02:18:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:49,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761541711] [2022-11-23 02:18:49,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:18:49,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:49,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:49,621 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:18:49,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 02:18:49,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:18:49,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:18:49,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 02:18:49,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:50,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:54,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:54,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761541711] [2022-11-23 02:18:54,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761541711] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:54,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:18:54,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2022-11-23 02:18:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786265497] [2022-11-23 02:18:54,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:54,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-23 02:18:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-23 02:18:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2022-11-23 02:18:54,073 INFO L87 Difference]: Start difference. First operand 236 states and 251 transitions. Second operand has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:19:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:19:47,094 INFO L93 Difference]: Finished difference Result 486 states and 552 transitions. [2022-11-23 02:19:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-23 02:19:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-11-23 02:19:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:19:47,099 INFO L225 Difference]: With dead ends: 486 [2022-11-23 02:19:47,099 INFO L226 Difference]: Without dead ends: 482 [2022-11-23 02:19:47,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2022-11-23 02:19:47,105 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 1234 mSDsluCounter, 4087 mSDsCounter, 0 mSdLazyCounter, 4263 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 4194 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 4263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:19:47,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 4194 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 4263 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-23 02:19:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-23 02:19:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 360. [2022-11-23 02:19:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 341 states have (on average 1.2082111436950147) internal successors, (412), 352 states have internal predecessors, (412), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:19:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 420 transitions. [2022-11-23 02:19:47,239 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 420 transitions. Word has length 136 [2022-11-23 02:19:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:19:47,240 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 420 transitions. [2022-11-23 02:19:47,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:19:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 420 transitions. [2022-11-23 02:19:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-23 02:19:47,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:19:47,249 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:47,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:47,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:47,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:19:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1598853735, now seen corresponding path program 1 times [2022-11-23 02:19:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:47,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380732461] [2022-11-23 02:19:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:47,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:47,466 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:19:47,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-23 02:19:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:47,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:19:47,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2022-11-23 02:19:47,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:47,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:47,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380732461] [2022-11-23 02:19:47,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380732461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:47,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:47,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:19:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661990525] [2022-11-23 02:19:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:19:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:19:47,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:19:47,726 INFO L87 Difference]: Start difference. First operand 360 states and 420 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-23 02:19:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:19:48,198 INFO L93 Difference]: Finished difference Result 378 states and 441 transitions. [2022-11-23 02:19:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:19:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 152 [2022-11-23 02:19:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:19:48,201 INFO L225 Difference]: With dead ends: 378 [2022-11-23 02:19:48,202 INFO L226 Difference]: Without dead ends: 375 [2022-11-23 02:19:48,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:19:48,203 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:19:48,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 153 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:19:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-23 02:19:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2022-11-23 02:19:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 348 states have (on average 1.206896551724138) internal successors, (420), 359 states have internal predecessors, (420), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 02:19:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 428 transitions. [2022-11-23 02:19:48,298 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 428 transitions. Word has length 152 [2022-11-23 02:19:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:19:48,298 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 428 transitions. [2022-11-23 02:19:48,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-23 02:19:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 428 transitions. [2022-11-23 02:19:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-23 02:19:48,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:19:48,301 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:48,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:48,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:48,513 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-23 02:19:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash 264409090, now seen corresponding path program 1 times [2022-11-23 02:19:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:48,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41471253] [2022-11-23 02:19:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:48,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:48,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:48,516 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:19:48,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-23 02:19:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:19:48,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:19:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:19:48,792 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 02:19:48,798 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:19:48,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2022-11-23 02:19:48,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2022-11-23 02:19:48,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2022-11-23 02:19:48,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2022-11-23 02:19:48,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2022-11-23 02:19:48,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2022-11-23 02:19:48,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2022-11-23 02:19:48,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2022-11-23 02:19:48,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2022-11-23 02:19:48,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2022-11-23 02:19:48,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2022-11-23 02:19:48,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2022-11-23 02:19:48,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2022-11-23 02:19:48,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2022-11-23 02:19:48,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2022-11-23 02:19:48,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2022-11-23 02:19:48,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2022-11-23 02:19:48,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2022-11-23 02:19:48,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2022-11-23 02:19:48,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2022-11-23 02:19:48,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2022-11-23 02:19:48,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2022-11-23 02:19:48,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2022-11-23 02:19:48,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2022-11-23 02:19:48,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:49,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:49,033 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:49,038 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:19:49,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:19:49 BoogieIcfgContainer [2022-11-23 02:19:49,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:19:49,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:19:49,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:19:49,151 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:19:49,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:09" (3/4) ... [2022-11-23 02:19:49,154 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:19:49,282 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:19:49,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:19:49,283 INFO L158 Benchmark]: Toolchain (without parser) took 101126.49ms. Allocated memory was 67.1MB in the beginning and 163.6MB in the end (delta: 96.5MB). Free memory was 44.3MB in the beginning and 129.7MB in the end (delta: -85.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,284 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 67.1MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:19:49,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.34ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 30.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.91ms. Allocated memory is still 67.1MB. Free memory was 30.2MB in the beginning and 28.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,286 INFO L158 Benchmark]: Boogie Preprocessor took 95.64ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 28.3MB in the beginning and 75.3MB in the end (delta: -46.9MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,286 INFO L158 Benchmark]: RCFGBuilder took 740.11ms. Allocated memory is still 94.4MB. Free memory was 75.3MB in the beginning and 56.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,287 INFO L158 Benchmark]: TraceAbstraction took 99580.42ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 56.0MB in the beginning and 137.0MB in the end (delta: -81.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,287 INFO L158 Benchmark]: Witness Printer took 132.08ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 129.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 02:19:49,296 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.34ms. Allocated memory is still 67.1MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.34ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 30.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.91ms. Allocated memory is still 67.1MB. Free memory was 30.2MB in the beginning and 28.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.64ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 28.3MB in the beginning and 75.3MB in the end (delta: -46.9MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * RCFGBuilder took 740.11ms. Allocated memory is still 94.4MB. Free memory was 75.3MB in the beginning and 56.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 99580.42ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 56.0MB in the beginning and 137.0MB in the end (delta: -81.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 132.08ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 129.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; [L238] CALL, EXPR base2flt(0, 0) VAL [unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [__retres4=0, e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L80] return (__retres4); VAL [\result=0, __retres4=0, e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L29] COND FALSE !(! m) VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L35] COND TRUE m < 1U << 24U VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=0, m=1, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-1, m=2, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-2, m=4, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-3, m=8, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-4, m=16, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-5, m=32, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-6, m=64, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-7, m=128, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-8, m=256, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-9, m=512, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-10, m=1024, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-11, m=2048, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-12, m=4096, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-13, m=8192, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-14, m=16384, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-15, m=32768, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-16, m=65536, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-17, m=131072, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-18, m=262144, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-19, m=524288, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-20, m=1048576, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-21, m=2097152, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-22, m=4194304, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND TRUE m < 1U << 24U VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L37] COND TRUE 1 VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L39] COND FALSE !(e <= -128) VAL [e=-23, m=8388608, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [e=-24, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L47] COND FALSE !(m < 1U << 24U) VAL [e=-24, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L76] m = m & ~ (1U << 24U) VAL [e=-24, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L77] EXPR e + 128 VAL [e=-24, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L77] EXPR (e + 128) << 24U [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [__retres4=1744830464, e=-24, m=0, res=1744830464, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L80] return (__retres4); VAL [\result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464, unknown-#in~e-unknown=0, unknown-#in~m-unknown=1] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L29] COND FALSE !(! m) VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L57] COND TRUE 1 VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [e=0, m=16777216, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L76] m = m & ~ (1U << 24U) VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L77] EXPR e + 128 VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] [L77] (e + 128) << 24U VAL [e=0, m=0, unknown-#in~e-unknown=0, unknown-#in~m-unknown=16777216] - 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: 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: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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 3 procedures, 98 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 99.4s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 81.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5338 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5338 mSDsluCounter, 14606 SdHoareTripleChecker+Invalid, 16.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13145 mSDsCounter, 982 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12317 IncrementalHoareTripleChecker+Invalid, 13299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 982 mSolverCounterUnsat, 1461 mSDtfsCounter, 12317 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 68.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=15, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1433 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 950 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1281 ConstructedInterpolants, 8 QuantifiedInterpolants, 7708 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 1576/6570 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 proved your program to be incorrect! [2022-11-23 02:19:49,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f67bd50-82d6-4db8-9d49-720f9af82aab/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)