./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- 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-2329fc7 [2022-12-13 16:24:22,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:24:22,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:24:22,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:24:22,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:24:22,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:24:22,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:24:22,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:24:22,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:24:22,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:24:22,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:24:22,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:24:22,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:24:22,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:24:22,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:24:22,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:24:22,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:24:22,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:24:22,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:24:22,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:24:22,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:24:22,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:24:22,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:24:22,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:24:22,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:24:22,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:24:22,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:24:22,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:24:22,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:24:22,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:24:22,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:24:22,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:24:22,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:24:22,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:24:22,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:24:22,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:24:22,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:24:22,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:24:22,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:24:22,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:24:22,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:24:22,281 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:24:22,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:24:22,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:24:22,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:24:22,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:24:22,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:24:22,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:24:22,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:24:22,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:24:22,296 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:24:22,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:24:22,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:24:22,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:24:22,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:24:22,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:24:22,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:24:22,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:24:22,299 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:24:22,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:24:22,299 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:24:22,299 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8 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 ! call(reach_error())) ) 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-12-13 16:24:22,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:24:22,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:24:22,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:24:22,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:24:22,495 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:24:22,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-12-13 16:24:25,060 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:24:25,195 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:24:25,196 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-12-13 16:24:25,200 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data/8bd15742e/c14f5a851c0847eeb6b49195623990ab/FLAG409156171 [2022-12-13 16:24:25,212 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data/8bd15742e/c14f5a851c0847eeb6b49195623990ab [2022-12-13 16:24:25,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:24:25,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:24:25,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:24:25,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:24:25,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:24:25,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2faef7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25, skipping insertion in model container [2022-12-13 16:24:25,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:24:25,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:24:25,361 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-12-13 16:24:25,367 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-12-13 16:24:25,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:24:25,378 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:24:25,389 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-12-13 16:24:25,392 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-12-13 16:24:25,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:24:25,404 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:24:25,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25 WrapperNode [2022-12-13 16:24:25,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:24:25,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:24:25,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:24:25,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:24:25,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,430 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-12-13 16:24:25,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:24:25,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:24:25,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:24:25,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:24:25,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,443 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:24:25,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:24:25,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:24:25,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:24:25,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (1/1) ... [2022-12-13 16:24:25,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:24:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:24:25,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:24:25,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:24:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:24:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:24:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:24:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:24:25,554 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:24:25,556 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:24:25,684 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:24:25,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:24:25,690 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:24:25,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:24:25 BoogieIcfgContainer [2022-12-13 16:24:25,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:24:25,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:24:25,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:24:25,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:24:25,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:24:25" (1/3) ... [2022-12-13 16:24:25,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee23c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:24:25, skipping insertion in model container [2022-12-13 16:24:25,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:25" (2/3) ... [2022-12-13 16:24:25,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee23c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:24:25, skipping insertion in model container [2022-12-13 16:24:25,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:24:25" (3/3) ... [2022-12-13 16:24:25,700 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-12-13 16:24:25,714 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:24:25,714 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:24:25,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:24:25,756 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;@38afdb74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:24:25,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 16:24:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:24:25,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:25,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:24:25,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:25,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-12-13 16:24:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:24:25,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075555505] [2022-12-13 16:24:25,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:24:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:24:25,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075555505] [2022-12-13 16:24:25,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075555505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:25,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:25,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:24:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725839884] [2022-12-13 16:24:25,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:25,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:24:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:24:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:24:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:24:25,999 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:24:26,070 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-12-13 16:24:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:24:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 16:24:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:24:26,085 INFO L225 Difference]: With dead ends: 45 [2022-12-13 16:24:26,085 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 16:24:26,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:24:26,091 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:24:26,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:24:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 16:24:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-12-13 16:24:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-12-13 16:24:26,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-12-13 16:24:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:24:26,123 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-12-13 16:24:26,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-12-13 16:24:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:24:26,123 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:26,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:24:26,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:24:26,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-12-13 16:24:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:24:26,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765570247] [2022-12-13 16:24:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:24:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:24:26,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:24:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:24:26,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:24:26,169 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:24:26,171 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 16:24:26,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 16:24:26,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:24:26,177 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 16:24:26,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:24:26,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:24:26 BoogieIcfgContainer [2022-12-13 16:24:26,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:24:26,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:24:26,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:24:26,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:24:26,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:24:25" (3/4) ... [2022-12-13 16:24:26,206 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:24:26,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:24:26,207 INFO L158 Benchmark]: Toolchain (without parser) took 991.95ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 97.3MB in the beginning and 124.3MB in the end (delta: -27.0MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-12-13 16:24:26,207 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:24:26,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.57ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 85.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 16:24:26,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.25ms. Allocated memory is still 132.1MB. Free memory was 85.3MB in the beginning and 83.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:24:26,209 INFO L158 Benchmark]: Boogie Preprocessor took 15.01ms. Allocated memory is still 132.1MB. Free memory was 83.6MB in the beginning and 82.8MB in the end (delta: 851.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:24:26,209 INFO L158 Benchmark]: RCFGBuilder took 246.32ms. Allocated memory is still 132.1MB. Free memory was 82.3MB in the beginning and 71.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 16:24:26,210 INFO L158 Benchmark]: TraceAbstraction took 507.48ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 70.2MB in the beginning and 124.3MB in the end (delta: -54.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:24:26,210 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 159.4MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:24:26,212 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.12ms. Allocated memory is still 132.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.57ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 85.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.25ms. Allocated memory is still 132.1MB. Free memory was 85.3MB in the beginning and 83.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.01ms. Allocated memory is still 132.1MB. Free memory was 83.6MB in the beginning and 82.8MB in the end (delta: 851.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 246.32ms. Allocated memory is still 132.1MB. Free memory was 82.3MB in the beginning and 71.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 507.48ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 70.2MB in the beginning and 124.3MB in the end (delta: -54.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 159.4MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of to_real at line 41. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=53, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=53, main__i=0] [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=53, main__E1=53, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=53, main__E1=53, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 44 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:24:26,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- 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-2329fc7 [2022-12-13 16:24:27,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:24:27,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:24:28,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:24:28,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:24:28,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:24:28,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:24:28,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:24:28,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:24:28,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:24:28,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:24:28,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:24:28,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:24:28,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:24:28,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:24:28,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:24:28,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:24:28,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:24:28,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:24:28,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:24:28,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:24:28,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:24:28,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:24:28,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:24:28,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:24:28,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:24:28,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:24:28,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:24:28,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:24:28,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:24:28,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:24:28,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:24:28,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:24:28,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:24:28,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:24:28,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:24:28,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:24:28,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:24:28,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:24:28,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:24:28,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:24:28,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 16:24:28,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:24:28,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:24:28,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:24:28,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:24:28,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:24:28,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:24:28,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:24:28,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:24:28,071 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:24:28,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:24:28,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:24:28,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:24:28,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:24:28,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:24:28,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:24:28,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:24:28,073 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:24:28,073 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:24:28,073 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:24:28,073 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:24:28,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:24:28,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:24:28,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:24:28,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:24:28,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:24:28,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:24:28,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:24:28,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:24:28,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:24:28,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:24:28,075 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:24:28,076 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:24:28,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:24:28,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:24:28,076 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:24:28,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:24:28,077 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:24:28,077 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:24:28,077 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8 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 ! call(reach_error())) ) 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-12-13 16:24:28,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:24:28,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:24:28,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:24:28,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:24:28,326 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:24:28,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-12-13 16:24:30,926 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:24:31,052 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:24:31,052 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-12-13 16:24:31,057 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data/bc17d4bd1/e2325ae0af37439e9160a1bbff7b90c5/FLAGf8061f0b9 [2022-12-13 16:24:31,069 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/data/bc17d4bd1/e2325ae0af37439e9160a1bbff7b90c5 [2022-12-13 16:24:31,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:24:31,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:24:31,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:24:31,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:24:31,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:24:31,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25066ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31, skipping insertion in model container [2022-12-13 16:24:31,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:24:31,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:24:31,223 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-12-13 16:24:31,230 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-12-13 16:24:31,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:24:31,243 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:24:31,255 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-12-13 16:24:31,258 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_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-12-13 16:24:31,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:24:31,272 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:24:31,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31 WrapperNode [2022-12-13 16:24:31,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:24:31,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:24:31,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:24:31,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:24:31,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,299 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-12-13 16:24:31,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:24:31,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:24:31,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:24:31,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:24:31,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,316 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:24:31,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:24:31,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:24:31,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:24:31,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (1/1) ... [2022-12-13 16:24:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:24:31,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:24:31,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:24:31,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:24:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:24:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:24:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:24:31,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:24:31,447 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:24:31,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:24:35,730 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:24:35,736 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:24:35,736 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:24:35,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:24:35 BoogieIcfgContainer [2022-12-13 16:24:35,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:24:35,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:24:35,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:24:35,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:24:35,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:24:31" (1/3) ... [2022-12-13 16:24:35,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270add94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:24:35, skipping insertion in model container [2022-12-13 16:24:35,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:24:31" (2/3) ... [2022-12-13 16:24:35,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270add94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:24:35, skipping insertion in model container [2022-12-13 16:24:35,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:24:35" (3/3) ... [2022-12-13 16:24:35,746 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-12-13 16:24:35,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:24:35,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:24:35,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:24:35,818 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;@55871261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:24:35,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 16:24:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:24:35,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:35,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:24:35,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-12-13 16:24:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:24:35,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305819064] [2022-12-13 16:24:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:35,847 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-12-13 16:24:35,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:24:35,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:35,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:35,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:24:35,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:24:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:35,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:24:35,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:24:35,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305819064] [2022-12-13 16:24:35,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305819064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:35,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:35,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:24:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147950020] [2022-12-13 16:24:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:35,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:24:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:24:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:24:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:24:36,019 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:24:36,100 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-12-13 16:24:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:24:36,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 16:24:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:24:36,108 INFO L225 Difference]: With dead ends: 59 [2022-12-13 16:24:36,108 INFO L226 Difference]: Without dead ends: 48 [2022-12-13 16:24:36,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12-13 16:24:36,113 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:24:36,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 129 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:24:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-13 16:24:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-12-13 16:24:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-12-13 16:24:36,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-12-13 16:24:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:24:36,139 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-12-13 16:24:36,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-12-13 16:24:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:24:36,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:36,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:24:36,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:24:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:36,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-12-13 16:24:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:24:36,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782995480] [2022-12-13 16:24:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:36,342 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-12-13 16:24:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:24:36,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:36,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:36,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:24:36,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:24:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:36,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:24:36,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:24:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782995480] [2022-12-13 16:24:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782995480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:36,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:24:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853634677] [2022-12-13 16:24:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:36,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:24:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:24:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:24:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:24:36,432 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:24:37,848 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-12-13 16:24:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:24:37,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 16:24:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:24:37,850 INFO L225 Difference]: With dead ends: 71 [2022-12-13 16:24:37,850 INFO L226 Difference]: Without dead ends: 51 [2022-12-13 16:24:37,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-13 16:24:37,851 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:24:37,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 16:24:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-13 16:24:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-12-13 16:24:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-12-13 16:24:37,857 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2022-12-13 16:24:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:24:37,857 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-12-13 16:24:37,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-12-13 16:24:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:24:37,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:37,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:24:37,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:24:38,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:38,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2022-12-13 16:24:38,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:24:38,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380452009] [2022-12-13 16:24:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:38,065 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-12-13 16:24:38,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:24:38,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:38,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:38,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:24:38,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:24:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:39,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:24:39,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:24:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380452009] [2022-12-13 16:24:39,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380452009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:39,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:39,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:24:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74015217] [2022-12-13 16:24:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:39,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:24:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:24:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:24:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:24:39,090 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:42,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:24:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:24:42,561 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-12-13 16:24:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:24:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 16:24:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:24:42,563 INFO L225 Difference]: With dead ends: 70 [2022-12-13 16:24:42,563 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 16:24:42,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:24:42,564 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:24:42,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 57 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 16:24:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 16:24:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-12-13 16:24:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-12-13 16:24:42,571 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2022-12-13 16:24:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:24:42,571 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-12-13 16:24:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-12-13 16:24:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:24:42,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:42,572 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:24:42,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:24:42,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:42,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2022-12-13 16:24:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:24:42,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575312523] [2022-12-13 16:24:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:42,779 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-12-13 16:24:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:24:42,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:42,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:42,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:24:42,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:24:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:42,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:24:42,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:24:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575312523] [2022-12-13 16:24:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575312523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:42,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:42,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:24:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954755623] [2022-12-13 16:24:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:42,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:24:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:24:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:24:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:24:42,897 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:24:42,963 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-12-13 16:24:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:24:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 16:24:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:24:42,965 INFO L225 Difference]: With dead ends: 49 [2022-12-13 16:24:42,965 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 16:24:42,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-12-13 16:24:42,966 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:24:42,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:24:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 16:24:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-13 16:24:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-12-13 16:24:42,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2022-12-13 16:24:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:24:42,973 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-12-13 16:24:42,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-12-13 16:24:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:24:42,973 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:42,973 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:24:42,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:43,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:43,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2022-12-13 16:24:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:24:43,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963276107] [2022-12-13 16:24:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:43,180 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-12-13 16:24:43,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:24:43,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:43,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:24:43,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:24:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:43,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:24:43,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:24:43,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963276107] [2022-12-13 16:24:43,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963276107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:43,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:43,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:24:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138448741] [2022-12-13 16:24:43,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:43,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:24:43,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:24:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:24:43,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:24:43,319 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:24:43,423 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-12-13 16:24:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:24:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 16:24:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:24:43,424 INFO L225 Difference]: With dead ends: 48 [2022-12-13 16:24:43,424 INFO L226 Difference]: Without dead ends: 46 [2022-12-13 16:24:43,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-12-13 16:24:43,425 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:24:43,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:24:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-13 16:24:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-12-13 16:24:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-12-13 16:24:43,429 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2022-12-13 16:24:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:24:43,429 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-12-13 16:24:43,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:24:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-12-13 16:24:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:24:43,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:24:43,429 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:24:43,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:24:43,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:43,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:24:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:24:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2022-12-13 16:24:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:24:43,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094439912] [2022-12-13 16:24:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:24:43,634 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-12-13 16:24:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:24:43,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:43,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:24:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:24:44,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:24:44,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:24:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:24:59,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:24:59,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:24:59,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094439912] [2022-12-13 16:24:59,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094439912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:24:59,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:24:59,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:24:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980592736] [2022-12-13 16:24:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:24:59,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:24:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:24:59,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:24:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=49, Unknown=4, NotChecked=0, Total=90 [2022-12-13 16:24:59,036 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:01,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:25:14,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:25:17,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse1) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-12-13 16:25:19,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:25:22,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:25:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:25:23,493 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-12-13 16:25:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:25:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 16:25:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:25:23,494 INFO L225 Difference]: With dead ends: 84 [2022-12-13 16:25:23,498 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 16:25:23,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=52, Invalid=77, Unknown=7, NotChecked=20, Total=156 [2022-12-13 16:25:23,499 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-12-13 16:25:23,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 64 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 83 Invalid, 2 Unknown, 1 Unchecked, 11.7s Time] [2022-12-13 16:25:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 16:25:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2022-12-13 16:25:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-12-13 16:25:23,505 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 24 [2022-12-13 16:25:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:25:23,505 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-12-13 16:25:23,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-12-13 16:25:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:25:23,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:25:23,506 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:25:23,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:25:23,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:25:23,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:25:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash -60423724, now seen corresponding path program 1 times [2022-12-13 16:25:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:25:23,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916317368] [2022-12-13 16:25:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:23,710 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-12-13 16:25:23,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:25:23,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:25:23,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:25:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:25,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 16:25:25,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:25:50,312 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 16:26:34,260 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-12-13 16:26:36,284 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-12-13 16:27:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:27:43,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:27:43,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:27:43,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916317368] [2022-12-13 16:27:43,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916317368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:27:43,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:27:43,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:27:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501451279] [2022-12-13 16:27:43,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:27:43,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:27:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:27:43,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:27:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=55, Unknown=3, NotChecked=34, Total=132 [2022-12-13 16:27:43,524 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:27:48,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:27:49,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:27:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:27:50,000 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-12-13 16:27:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:27:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 16:27:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:27:50,001 INFO L225 Difference]: With dead ends: 71 [2022-12-13 16:27:50,001 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 16:27:50,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=47, Invalid=68, Unknown=3, NotChecked=38, Total=156 [2022-12-13 16:27:50,002 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:27:50,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 59 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 1 Unknown, 102 Unchecked, 6.3s Time] [2022-12-13 16:27:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 16:27:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2022-12-13 16:27:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:27:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-12-13 16:27:50,009 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 24 [2022-12-13 16:27:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:27:50,009 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-12-13 16:27:50,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:27:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-12-13 16:27:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 16:27:50,010 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:27:50,010 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:27:50,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:27:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:27:50,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:27:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:27:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1904984945, now seen corresponding path program 1 times [2022-12-13 16:27:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:27:50,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102651460] [2022-12-13 16:27:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:27:50,214 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-12-13 16:27:50,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:27:50,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:27:50,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:27:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:27:51,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 16:27:51,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:28:16,698 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 16:28:57,352 WARN L837 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 16:29:26,485 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from false [2022-12-13 16:29:28,512 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from true [2022-12-13 16:30:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:30:48,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:48,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:30:48,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102651460] [2022-12-13 16:30:48,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102651460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:48,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:48,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 16:30:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481264838] [2022-12-13 16:30:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:48,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 16:30:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:30:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 16:30:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=56, Unknown=4, NotChecked=54, Total=156 [2022-12-13 16:30:48,486 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:30:52,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:30:56,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:30:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:56,131 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-12-13 16:30:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:30:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 16:30:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:56,132 INFO L225 Difference]: With dead ends: 73 [2022-12-13 16:30:56,133 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 16:30:56,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=49, Invalid=69, Unknown=4, NotChecked=60, Total=182 [2022-12-13 16:30:56,133 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:56,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 76 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 2 Unknown, 147 Unchecked, 7.4s Time] [2022-12-13 16:30:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 16:30:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2022-12-13 16:30:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:30:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-12-13 16:30:56,140 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 25 [2022-12-13 16:30:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:56,140 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-12-13 16:30:56,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:30:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-12-13 16:30:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 16:30:56,141 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:56,141 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:30:56,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:30:56,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:30:56,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1204213622, now seen corresponding path program 1 times [2022-12-13 16:30:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:30:56,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507555983] [2022-12-13 16:30:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:56,343 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-12-13 16:30:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:30:56,344 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:30:56,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e736a17-62f7-4e1e-adf8-ec54d2ab8d69/bin/uautomizer-uyxdKDjOR8/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-12-13 16:30:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:57,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:30:57,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:31:29,952 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_24| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_24|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_24| (fp.neg .cse0)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 16:32:31,810 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_24|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse2)) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_24| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_24| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-12-13 16:32:33,837 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_24|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse2)) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_24| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_24| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-12-13 16:34:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-13 16:34:06,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:34:12,818 WARN L837 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2022-12-13 16:34:14,869 WARN L859 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2022-12-13 16:34:29,328 WARN L837 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-12-13 16:34:31,383 WARN L859 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-12-13 16:34:45,945 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2022-12-13 16:35:50,470 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2022-12-13 16:36:05,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from false [2022-12-13 16:36:07,061 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from true [2022-12-13 16:36:29,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) is different from false [2022-12-13 16:36:32,011 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) is different from true [2022-12-13 16:37:36,699 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1)))) is different from true [2022-12-13 16:37:59,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse3 (fp.neg .cse2))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |ULTIMATE.start_main_~main__E0~0#1|) .cse3))))))))) is different from false [2022-12-13 16:38:01,661 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse3 (fp.neg .cse2))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |ULTIMATE.start_main_~main__E0~0#1|) .cse3))))))))) is different from true