./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:55:26,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:55:26,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:55:26,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:55:26,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:55:26,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:55:26,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:55:26,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:55:26,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:55:26,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:55:26,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:55:26,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:55:26,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:55:26,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:55:26,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:55:26,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:55:26,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:55:26,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:55:26,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:55:26,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:55:26,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:55:26,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:55:26,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:55:26,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:55:26,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:55:26,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:55:26,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:55:26,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:55:26,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:55:26,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:55:26,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:55:26,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:55:26,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:55:26,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:55:26,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:55:26,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:55:26,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:55:26,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:55:26,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:55:26,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:55:26,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:55:26,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:55:26,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:55:26,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:55:26,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:55:26,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:55:26,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:55:26,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:55:26,224 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:55:26,225 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:55:26,225 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:55:26,225 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:55:26,225 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:55:26,225 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:55:26,226 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:55:26,226 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:55:26,226 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:55:26,226 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:55:26,227 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:55:26,227 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:55:26,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:55:26,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:55:26,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:55:26,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:55:26,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:55:26,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:55:26,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:55:26,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:55:26,229 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:55:26,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:55:26,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:55:26,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:55:26,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:55:26,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:55:26,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:26,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:55:26,231 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:55:26,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:55:26,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:55:26,232 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:55:26,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:55:26,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:55:26,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:55:26,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/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_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2022-11-03 03:55:26,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:55:26,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:55:26,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:55:26,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:55:26,524 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:55:26,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-03 03:55:26,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/d7957bc46/e21299d70d114dc3a75661205b8a3672/FLAG6fc8f8c8e [2022-11-03 03:55:27,052 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:55:27,053 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-03 03:55:27,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/d7957bc46/e21299d70d114dc3a75661205b8a3672/FLAG6fc8f8c8e [2022-11-03 03:55:27,445 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/d7957bc46/e21299d70d114dc3a75661205b8a3672 [2022-11-03 03:55:27,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:55:27,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:55:27,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:27,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:55:27,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:55:27,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9b5add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27, skipping insertion in model container [2022-11-03 03:55:27,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:55:27,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:55:27,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-03 03:55:27,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:27,765 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:55:27,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-03 03:55:27,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:27,823 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:55:27,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27 WrapperNode [2022-11-03 03:55:27,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:27,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:27,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:55:27,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:55:27,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,861 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-11-03 03:55:27,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:27,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:55:27,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:55:27,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:55:27,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,897 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:55:27,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:55:27,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:55:27,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:55:27,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (1/1) ... [2022-11-03 03:55:27,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:27,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:55:27,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:55:27,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:55:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:55:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:55:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:55:27,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:55:28,050 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:55:28,052 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:55:28,166 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:55:28,203 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:55:28,206 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:55:28,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:28 BoogieIcfgContainer [2022-11-03 03:55:28,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:55:28,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:55:28,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:55:28,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:55:28,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:55:27" (1/3) ... [2022-11-03 03:55:28,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c622dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:28, skipping insertion in model container [2022-11-03 03:55:28,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:27" (2/3) ... [2022-11-03 03:55:28,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c622dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:28, skipping insertion in model container [2022-11-03 03:55:28,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:28" (3/3) ... [2022-11-03 03:55:28,222 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-11-03 03:55:28,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:55:28,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:55:28,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:55:28,318 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e87022b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:55:28,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:55:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:55:28,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:28,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:28,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:28,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1090715464, now seen corresponding path program 1 times [2022-11-03 03:55:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:28,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722493633] [2022-11-03 03:55:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:28,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:28,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722493633] [2022-11-03 03:55:28,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722493633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:28,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:28,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:55:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042018541] [2022-11-03 03:55:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:28,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:55:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:28,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:55:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:28,581 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:28,646 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2022-11-03 03:55:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:55:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-03 03:55:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:28,656 INFO L225 Difference]: With dead ends: 32 [2022-11-03 03:55:28,657 INFO L226 Difference]: Without dead ends: 12 [2022-11-03 03:55:28,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:28,664 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:28,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:55:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-03 03:55:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-03 03:55:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-11-03 03:55:28,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2022-11-03 03:55:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:28,699 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-11-03 03:55:28,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-11-03 03:55:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:55:28,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:28,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:28,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:55:28,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash -201086419, now seen corresponding path program 1 times [2022-11-03 03:55:28,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:28,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607657252] [2022-11-03 03:55:28,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:28,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:28,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607657252] [2022-11-03 03:55:28,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607657252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:28,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:28,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:55:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040430610] [2022-11-03 03:55:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:28,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:55:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:55:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:55:28,801 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:28,898 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-03 03:55:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:55:28,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-11-03 03:55:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:28,899 INFO L225 Difference]: With dead ends: 29 [2022-11-03 03:55:28,899 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 03:55:28,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:55:28,902 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:28,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:55:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 03:55:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2022-11-03 03:55:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-03 03:55:28,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-11-03 03:55:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:28,909 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-03 03:55:28,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-03 03:55:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:55:28,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:28,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:55:28,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash -184075758, now seen corresponding path program 1 times [2022-11-03 03:55:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:28,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575697060] [2022-11-03 03:55:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:55:28,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:55:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:55:28,974 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:55:28,974 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:55:28,976 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:55:28,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:55:28,985 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 03:55:28,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:55:29,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:55:29 BoogieIcfgContainer [2022-11-03 03:55:29,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:55:29,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:55:29,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:55:29,035 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:55:29,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:28" (3/4) ... [2022-11-03 03:55:29,038 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 03:55:29,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:55:29,039 INFO L158 Benchmark]: Toolchain (without parser) took 1589.67ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 92.9MB in the end (delta: -14.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:55:29,039 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:55:29,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.84ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 92.1MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:55:29,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.76ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 90.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:55:29,042 INFO L158 Benchmark]: Boogie Preprocessor took 38.21ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:55:29,043 INFO L158 Benchmark]: RCFGBuilder took 302.84ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 78.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:55:29,043 INFO L158 Benchmark]: TraceAbstraction took 820.45ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 92.9MB in the end (delta: -14.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-03 03:55:29,044 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 92.9MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:55:29,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.84ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 92.1MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.76ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 90.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.21ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.84ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 78.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 820.45ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 92.9MB in the end (delta: -14.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 92.9MB in the end (delta: 2.6kB). 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: 56]: 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 43, overapproximation of to_real at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L1] int __return_main; [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__E0=53, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=53, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__E0=53, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main__E0=53, main__E1=53, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main__E0=53, main__E1=53, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=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] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=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] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=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] reach_error() VAL [__return_main=0, __tmp_1=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-11-03 03:55:29,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:55:31,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:55:31,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:55:31,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:55:31,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:55:31,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:55:31,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:55:31,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:55:31,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:55:31,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:55:31,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:55:31,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:55:31,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:55:31,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:55:31,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:55:31,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:55:31,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:55:31,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:55:31,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:55:31,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:55:31,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:55:31,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:55:31,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:55:31,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:55:31,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:55:31,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:55:31,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:55:31,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:55:31,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:55:31,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:55:31,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:55:31,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:55:31,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:55:31,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:55:31,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:55:31,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:55:31,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:55:31,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:55:31,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:55:31,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:55:31,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:55:31,545 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 03:55:31,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:55:31,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:55:31,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:55:31,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:55:31,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:55:31,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:55:31,588 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:55:31,588 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:55:31,588 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:55:31,588 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:55:31,589 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:55:31,590 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:55:31,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:55:31,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:55:31,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:55:31,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:55:31,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:55:31,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:55:31,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:55:31,593 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:55:31,593 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 03:55:31,593 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 03:55:31,593 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:55:31,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:55:31,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:55:31,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:55:31,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:55:31,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 03:55:31,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:55:31,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:31,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:55:31,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:55:31,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:55:31,596 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 03:55:31,597 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 03:55:31,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:55:31,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:55:31,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 03:55:31,598 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/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_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2022-11-03 03:55:31,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:55:32,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:55:32,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:55:32,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:55:32,013 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:55:32,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-03 03:55:32,101 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/c49f7b4ba/d49c27abd40a42f0a707153490abb935/FLAG6e65a163f [2022-11-03 03:55:32,627 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:55:32,629 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-03 03:55:32,637 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/c49f7b4ba/d49c27abd40a42f0a707153490abb935/FLAG6e65a163f [2022-11-03 03:55:32,988 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/data/c49f7b4ba/d49c27abd40a42f0a707153490abb935 [2022-11-03 03:55:32,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:55:32,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:55:32,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:32,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:55:32,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:55:33,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:32" (1/1) ... [2022-11-03 03:55:33,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab750e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33, skipping insertion in model container [2022-11-03 03:55:33,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:32" (1/1) ... [2022-11-03 03:55:33,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:55:33,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:55:33,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-03 03:55:33,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:33,205 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:55:33,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-03 03:55:33,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:33,280 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:55:33,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33 WrapperNode [2022-11-03 03:55:33,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:33,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:33,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:55:33,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:55:33,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,325 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-11-03 03:55:33,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:33,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:55:33,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:55:33,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:55:33,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:55:33,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:55:33,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:55:33,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:55:33,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (1/1) ... [2022-11-03 03:55:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:33,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:55:33,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:55:33,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:55:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:55:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 03:55:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:55:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:55:33,521 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:55:33,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:55:34,281 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:55:34,288 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:55:34,288 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:55:34,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:34 BoogieIcfgContainer [2022-11-03 03:55:34,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:55:34,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:55:34,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:55:34,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:55:34,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:55:32" (1/3) ... [2022-11-03 03:55:34,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a695ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:34, skipping insertion in model container [2022-11-03 03:55:34,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:33" (2/3) ... [2022-11-03 03:55:34,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a695ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:34, skipping insertion in model container [2022-11-03 03:55:34,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:34" (3/3) ... [2022-11-03 03:55:34,306 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-11-03 03:55:34,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:55:34,328 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:55:34,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:55:34,407 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a212375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:55:34,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:55:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:55:34,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:34,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:34,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2022-11-03 03:55:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:34,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917014322] [2022-11-03 03:55:34,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:34,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:34,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:34,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:34,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 03:55:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:34,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:55:34,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:34,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:34,572 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:34,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917014322] [2022-11-03 03:55:34,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917014322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:34,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:34,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:55:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447856145] [2022-11-03 03:55:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:34,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:55:34,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:34,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:55:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:34,613 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 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-11-03 03:55:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:34,661 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-11-03 03:55:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:55:34,664 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-11-03 03:55:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:34,673 INFO L225 Difference]: With dead ends: 40 [2022-11-03 03:55:34,673 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 03:55:34,676 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-11-03 03:55:34,680 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:34,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:55:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 03:55:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-03 03:55:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-11-03 03:55:34,713 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2022-11-03 03:55:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:34,713 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-11-03 03:55:34,714 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-11-03 03:55:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-11-03 03:55:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:55:34,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:34,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:34,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:34,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:34,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2022-11-03 03:55:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:34,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693473189] [2022-11-03 03:55:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:34,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:34,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:34,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:34,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 03:55:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:35,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:55:35,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:35,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:35,100 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:35,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693473189] [2022-11-03 03:55:35,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693473189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:35,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:35,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:55:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586219249] [2022-11-03 03:55:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:35,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:55:35,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:55:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:55:35,105 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. 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-11-03 03:55:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:35,226 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-11-03 03:55:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:55:35,228 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-11-03 03:55:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:35,229 INFO L225 Difference]: With dead ends: 30 [2022-11-03 03:55:35,229 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 03:55:35,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:55:35,231 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:35,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:55:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 03:55:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2022-11-03 03:55:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-11-03 03:55:35,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-11-03 03:55:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:35,240 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-03 03:55:35,241 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-11-03 03:55:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-11-03 03:55:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:55:35,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:35,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:35,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:35,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:35,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2022-11-03 03:55:35,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:35,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631537338] [2022-11-03 03:55:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:35,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:35,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 03:55:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:35,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:55:35,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:35,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:35,584 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:35,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631537338] [2022-11-03 03:55:35,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631537338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:35,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:35,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:55:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869123820] [2022-11-03 03:55:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:35,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:55:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:55:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:35,595 INFO L87 Difference]: Start difference. First operand 17 states and 20 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-11-03 03:55:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:36,188 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-11-03 03:55:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:55:36,189 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-11-03 03:55:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:36,190 INFO L225 Difference]: With dead ends: 42 [2022-11-03 03:55:36,190 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 03:55:36,190 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-11-03 03:55:36,192 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:36,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:55:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 03:55:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-11-03 03:55:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-03 03:55:36,199 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-11-03 03:55:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:36,200 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-03 03:55:36,200 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-11-03 03:55:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-03 03:55:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:55:36,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:36,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:36,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:36,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:36,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2022-11-03 03:55:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:36,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646342698] [2022-11-03 03:55:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:36,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:36,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:36,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:36,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 03:55:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:36,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:55:36,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:37,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:37,633 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:37,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646342698] [2022-11-03 03:55:37,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646342698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:37,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:37,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:55:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421359757] [2022-11-03 03:55:37,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:37,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:55:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:37,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:55:37,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:55:37,635 INFO L87 Difference]: Start difference. First operand 20 states and 23 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-11-03 03:55:40,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:55:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:40,435 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-11-03 03:55:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:55:40,438 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-11-03 03:55:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:40,439 INFO L225 Difference]: With dead ends: 47 [2022-11-03 03:55:40,439 INFO L226 Difference]: Without dead ends: 29 [2022-11-03 03:55:40,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:55:40,440 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:40,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 1 Unknown, 10 Unchecked, 2.8s Time] [2022-11-03 03:55:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-03 03:55:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-03 03:55:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-03 03:55:40,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2022-11-03 03:55:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:40,458 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-03 03:55:40,459 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-11-03 03:55:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-03 03:55:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:55:40,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:40,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:40,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:40,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:40,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:40,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1249715145, now seen corresponding path program 1 times [2022-11-03 03:55:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:40,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885853112] [2022-11-03 03:55:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:40,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:40,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 03:55:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:41,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:55:41,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:41,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:41,845 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:41,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885853112] [2022-11-03 03:55:41,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885853112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:41,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:41,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:55:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015936715] [2022-11-03 03:55:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:41,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:55:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:55:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:55:41,847 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:44,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:55:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:44,526 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-03 03:55:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:55:44,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-11-03 03:55:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:44,529 INFO L225 Difference]: With dead ends: 49 [2022-11-03 03:55:44,529 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 03:55:44,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:55:44,530 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:44,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 1 Unknown, 4 Unchecked, 2.7s Time] [2022-11-03 03:55:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 03:55:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-03 03:55:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-03 03:55:44,537 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-11-03 03:55:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:44,537 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-03 03:55:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-03 03:55:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:55:44,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:44,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:44,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:44,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:44,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:55:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2022-11-03 03:55:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478303319] [2022-11-03 03:55:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:44,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:44,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 03:55:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:45,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:55:45,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:01,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:09,988 WARN L833 $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-11-03 03:56:12,030 WARN L855 $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-11-03 03:56:26,209 WARN L833 $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-11-03 03:56:28,255 WARN L855 $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-11-03 03:56:42,736 WARN L855 $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-11-03 03:57:57,908 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .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|) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) is different from true [2022-11-03 03:58:17,893 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from true [2022-11-03 03:58:24,368 WARN L833 $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_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))))) is different from false [2022-11-03 03:58:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 03:58:26,267 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:58:26,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478303319] [2022-11-03 03:58:26,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478303319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [311399902] [2022-11-03 03:58:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:26,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:58:26,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:58:26,271 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:58:26,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-03 03:58:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:27,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:58:27,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:32,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:17,762 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (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|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2022-11-03 04:00:44,995 WARN L833 $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_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))))) is different from false [2022-11-03 04:00:47,007 WARN L855 $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_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))))) is different from true [2022-11-03 04:00:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 04:00:55,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [311399902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:55,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515110050] [2022-11-03 04:00:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:55,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:55,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:55,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:55,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:00:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:59,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:00:59,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:16,995 WARN L833 $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 ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from false [2022-11-03 04:01:19,004 WARN L855 $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 ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from true [2022-11-03 04:01:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:01:44,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:16,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (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| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))))) is different from false [2022-11-03 04:02:18,098 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (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| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))))) is different from true [2022-11-03 04:02:32,655 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (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|) |ULTIMATE.start_main_#t~nondet4#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_#t~nondet4#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse0)))))) is different from true [2022-11-03 04:03:37,030 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#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_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2022-11-03 04:04:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 04:04:08,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515110050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:08,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:04:08,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 10] total 23 [2022-11-03 04:04:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283950461] [2022-11-03 04:04:08,679 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:08,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 04:04:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:04:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 04:04:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=85, Unknown=23, NotChecked=330, Total=506 [2022-11-03 04:04:08,682 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:10,713 WARN L833 $PredicateComparison]: unable to prove that (and (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_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 04:04:32,713 WARN L234 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:04:45,507 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-03 04:04:48,600 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse3 (fp.neg .cse2))) (and (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| .cse3)))) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-03 04:04:51,041 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse3 (fp.neg .cse2))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3))) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-03 04:04:53,637 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse2)) (.cse5 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)))) (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__E1~0#1| .cse2) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse4) .cse5) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)))) .cse5) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-03 04:04:56,609 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse2))) (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__E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse4) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-03 04:04:58,704 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse1))))))) is different from true [2022-11-03 04:05:11,685 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| .cse3)))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) is different from true [2022-11-03 04:05:13,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) is different from false [2022-11-03 04:05:15,874 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) is different from true [2022-11-03 04:05:17,934 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse2 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3)))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) .cse2) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse3))))) .cse2)))) is different from false [2022-11-03 04:05:20,002 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse2 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3)))) (and (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) .cse2) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse3))))) .cse2)))) is different from true [2022-11-03 04:05:22,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2))) is different from false [2022-11-03 04:05:24,143 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2))) is different from true [2022-11-03 04:05:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:24,145 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-11-03 04:05:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:05:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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 23 [2022-11-03 04:05:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:24,146 INFO L225 Difference]: With dead ends: 67 [2022-11-03 04:05:24,147 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 04:05:24,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 150.7s TimeCoverageRelationStatistics Valid=108, Invalid=144, Unknown=46, NotChecked=1034, Total=1332 [2022-11-03 04:05:24,149 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:24,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 197 Unchecked, 0.1s Time] [2022-11-03 04:05:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 04:05:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2022-11-03 04:05:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-03 04:05:24,166 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2022-11-03 04:05:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:24,167 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-03 04:05:24,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-03 04:05:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:05:24,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:24,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:24,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:24,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-03 04:05:24,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:24,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 04:05:24,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:24,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2022-11-03 04:05:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:05:24,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476588272] [2022-11-03 04:05:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:24,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:05:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:05:24,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:05:24,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca9cc7-4ce4-4f91-a38f-2060237ac495/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 04:05:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:27,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 04:05:27,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:52,342 WARN L833 $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-11-03 04:06:34,059 WARN L833 $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-11-03 04:06:36,093 WARN L855 $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-11-03 04:07:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:07:43,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:50,166 WARN L833 $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-11-03 04:07:52,224 WARN L855 $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-11-03 04:08:06,716 WARN L833 $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-11-03 04:08:08,781 WARN L855 $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-11-03 04:08:23,378 WARN L855 $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-11-03 04:09:15,560 WARN L855 $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-11-03 04:09:30,195 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2))) (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|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))))) is different from true [2022-11-03 04:09:44,811 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| (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|) |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1)))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))))) is different from true [2022-11-03 04:10:08,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse4)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1)))) (not (fp.leq .cse0 .cse4))))) is different from false [2022-11-03 04:10:10,530 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse4)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1)))) (not (fp.leq .cse0 .cse4))))) is different from true [2022-11-03 04:10:59,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.neg .cse4)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1))) (not (fp.leq .cse0 .cse4))))) is different from false [2022-11-03 04:11:01,590 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.neg .cse4)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_20| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_20| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_20| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) |v_ULTIMATE.start_main_~main__E0~0#1_20|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1))) (not (fp.leq .cse0 .cse4))))) is different from true