./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sin_interpolated_negation.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_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sin_interpolated_negation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/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 9fc903c4e042f1a917ff23806dc398a0ae6250449674c68af7855fc8b73da478 --- 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 01:58:17,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:58:17,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:58:17,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:58:17,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:58:17,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:58:17,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:58:17,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:58:17,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:58:17,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:58:17,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:58:17,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:58:17,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:58:17,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:58:17,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:58:17,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:58:17,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:58:17,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:58:17,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:58:17,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:58:17,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:58:17,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:58:17,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:58:17,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:58:17,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:58:17,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:58:17,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:58:17,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:58:17,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:58:17,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:58:17,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:58:17,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:58:17,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:58:17,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:58:17,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:58:17,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:58:17,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:58:17,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:58:17,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:58:17,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:58:17,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:58:17,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:58:17,213 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:58:17,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:58:17,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:58:17,218 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:58:17,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:58:17,219 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:58:17,219 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:58:17,219 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:58:17,219 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:58:17,220 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:58:17,221 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:58:17,221 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:58:17,221 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:58:17,221 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:58:17,222 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:58:17,222 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:58:17,222 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:58:17,222 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:58:17,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:58:17,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:58:17,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:58:17,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:58:17,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:58:17,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:58:17,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:58:17,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:58:17,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:58:17,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:58:17,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:58:17,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:58:17,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:58:17,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:58:17,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:17,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:58:17,227 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:58:17,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:58:17,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:58:17,227 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:58:17,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:58:17,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:58:17,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:58:17,228 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_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/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 -> 9fc903c4e042f1a917ff23806dc398a0ae6250449674c68af7855fc8b73da478 [2022-11-03 01:58:17,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:58:17,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:58:17,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:58:17,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:58:17,554 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:58:17,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/sin_interpolated_negation.c [2022-11-03 01:58:17,641 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/b89d81fad/2c1bd85f441a4d97bde07b9d90238f6e/FLAG402e2e4e9 [2022-11-03 01:58:18,156 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:58:18,157 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/sv-benchmarks/c/float-benchs/sin_interpolated_negation.c [2022-11-03 01:58:18,175 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/b89d81fad/2c1bd85f441a4d97bde07b9d90238f6e/FLAG402e2e4e9 [2022-11-03 01:58:18,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/b89d81fad/2c1bd85f441a4d97bde07b9d90238f6e [2022-11-03 01:58:18,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:58:18,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:58:18,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:18,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:58:18,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:58:18,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:18" (1/1) ... [2022-11-03 01:58:18,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57451835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:18, skipping insertion in model container [2022-11-03 01:58:18,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:18" (1/1) ... [2022-11-03 01:58:18,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:58:18,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:58:18,752 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_8c5089f5-99ed-4378-9022-1dc9454d00ed/sv-benchmarks/c/float-benchs/sin_interpolated_negation.c[684,697] [2022-11-03 01:58:18,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:18,884 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:58:18,909 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_8c5089f5-99ed-4378-9022-1dc9454d00ed/sv-benchmarks/c/float-benchs/sin_interpolated_negation.c[684,697] [2022-11-03 01:58:18,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:19,016 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:58:19,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19 WrapperNode [2022-11-03 01:58:19,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:19,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:19,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:58:19,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:58:19,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,100 INFO L138 Inliner]: procedures = 21, calls = 382, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 405 [2022-11-03 01:58:19,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:19,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:58:19,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:58:19,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:58:19,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:58:19,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:58:19,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:58:19,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:58:19,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (1/1) ... [2022-11-03 01:58:19,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:19,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:58:19,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:58:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:58:19,260 INFO L130 BoogieDeclarations]: Found specification of procedure SIN_POS [2022-11-03 01:58:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN_POS [2022-11-03 01:58:19,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:58:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure SIN_0_180 [2022-11-03 01:58:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN_0_180 [2022-11-03 01:58:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure SIN_180 [2022-11-03 01:58:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN_180 [2022-11-03 01:58:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-03 01:58:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure SIN [2022-11-03 01:58:19,262 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN [2022-11-03 01:58:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:58:19,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:58:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-03 01:58:19,356 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:58:19,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:58:19,822 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:58:19,918 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:58:19,919 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:58:19,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:19 BoogieIcfgContainer [2022-11-03 01:58:19,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:58:19,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:58:19,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:58:19,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:58:19,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:58:18" (1/3) ... [2022-11-03 01:58:19,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d11f6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:58:19, skipping insertion in model container [2022-11-03 01:58:19,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:19" (2/3) ... [2022-11-03 01:58:19,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d11f6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:58:19, skipping insertion in model container [2022-11-03 01:58:19,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:19" (3/3) ... [2022-11-03 01:58:19,934 INFO L112 eAbstractionObserver]: Analyzing ICFG sin_interpolated_negation.c [2022-11-03 01:58:19,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:58:19,953 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:58:20,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:58:20,053 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;@1774a69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:58:20,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:58:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:58:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 01:58:20,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:20,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:20,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2055068064, now seen corresponding path program 1 times [2022-11-03 01:58:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486185706] [2022-11-03 01:58:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:58:20,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 01:58:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:58:20,595 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 01:58:20,598 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 01:58:20,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:58:20,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:58:20,605 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-03 01:58:20,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:58:20,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:58:20 BoogieIcfgContainer [2022-11-03 01:58:20,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:58:20,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:58:20,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:58:20,675 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:58:20,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:19" (3/4) ... [2022-11-03 01:58:20,678 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 01:58:20,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:58:20,680 INFO L158 Benchmark]: Toolchain (without parser) took 2190.84ms. Allocated memory is still 119.5MB. Free memory was 86.9MB in the beginning and 59.8MB in the end (delta: 27.1MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-11-03 01:58:20,681 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 88.1MB. Free memory was 44.2MB in the beginning and 44.1MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:58:20,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.72ms. Allocated memory is still 119.5MB. Free memory was 86.9MB in the beginning and 86.4MB in the end (delta: 491.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:58:20,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.16ms. Allocated memory is still 119.5MB. Free memory was 86.4MB in the beginning and 81.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:58:20,684 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 119.5MB. Free memory was 81.9MB in the beginning and 78.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:58:20,689 INFO L158 Benchmark]: RCFGBuilder took 773.77ms. Allocated memory is still 119.5MB. Free memory was 78.1MB in the beginning and 47.7MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-03 01:58:20,690 INFO L158 Benchmark]: TraceAbstraction took 748.72ms. Allocated memory is still 119.5MB. Free memory was 47.0MB in the beginning and 59.8MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:58:20,691 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 119.5MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:58:20,699 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.28ms. Allocated memory is still 88.1MB. Free memory was 44.2MB in the beginning and 44.1MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.72ms. Allocated memory is still 119.5MB. Free memory was 86.9MB in the beginning and 86.4MB in the end (delta: 491.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.16ms. Allocated memory is still 119.5MB. Free memory was 86.4MB in the beginning and 81.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 119.5MB. Free memory was 81.9MB in the beginning and 78.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 773.77ms. Allocated memory is still 119.5MB. Free memory was 78.1MB in the beginning and 47.7MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 748.72ms. Allocated memory is still 119.5MB. Free memory was 47.0MB in the beginning and 59.8MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 119.5MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 2.7kB). 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: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 121, overapproximation of someUnaryDOUBLEoperation at line 130, overapproximation of someBinaryArithmeticDOUBLEoperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of to_real at line 122. Possible FailurePath: [L20-L112] const double T[362] = { 0.00000000000000, 0.01745240643728, 0.03489949670250, 0.05233595624294, 0.06975647374413, 0.08715574274766, 0.10452846326765, 0.12186934340515, 0.13917310096007, 0.15643446504023, 0.17364817766693, 0.19080899537654, 0.20791169081776, 0.22495105434386, 0.24192189559967, 0.25881904510252, 0.27563735581700, 0.29237170472274, 0.30901699437495, 0.32556815445716, 0.34202014332567, 0.35836794954530, 0.37460659341591, 0.39073112848927, 0.40673664307580, 0.42261826174070, 0.43837114678908, 0.45399049973955, 0.46947156278589, 0.48480962024634, 0.50000000000000, 0.51503807491005, 0.52991926423320, 0.54463903501503, 0.55919290347075, 0.57357643635105, 0.58778525229247, 0.60181502315205, 0.61566147532566, 0.62932039104984, 0.64278760968654, 0.65605902899051, 0.66913060635886, 0.68199836006250, 0.69465837045900, 0.70710678118655, 0.71933980033865, 0.73135370161917, 0.74314482547739, 0.75470958022277, 0.76604444311898, 0.77714596145697, 0.78801075360672, 0.79863551004729, 0.80901699437495, 0.81915204428899, 0.82903757255504, 0.83867056794542, 0.84804809615643, 0.85716730070211, 0.86602540378444, 0.87461970713940, 0.88294759285893, 0.89100652418837, 0.89879404629917, 0.90630778703665, 0.91354545764260, 0.92050485345244, 0.92718385456679, 0.93358042649720, 0.93969262078591, 0.94551857559932, 0.95105651629515, 0.95630475596304, 0.96126169593832, 0.96592582628907, 0.97029572627600, 0.97437006478524, 0.97814760073381, 0.98162718344766, 0.98480775301221, 0.98768834059514, 0.99026806874157, 0.99254615164132, 0.99452189536827, 0.99619469809175, 0.99756405025982, 0.99862953475457, 0.99939082701910, 0.99984769515639, 1.00000000000000, 0.99984769515639, 0.99939082701910, 0.99862953475457, 0.99756405025982, 0.99619469809175, 0.99452189536827, 0.99254615164132, 0.99026806874157, 0.98768834059514, 0.98480775301221, 0.98162718344766, 0.97814760073381, 0.97437006478524, 0.97029572627600, 0.96592582628907, 0.96126169593832, 0.95630475596304, 0.95105651629515, 0.94551857559932, 0.93969262078591, 0.93358042649720, 0.92718385456679, 0.92050485345244, 0.91354545764260, 0.90630778703665, 0.89879404629917, 0.89100652418837, 0.88294759285893, 0.87461970713940, 0.86602540378444, 0.85716730070211, 0.84804809615643, 0.83867056794542, 0.82903757255504, 0.81915204428899, 0.80901699437495, 0.79863551004729, 0.78801075360672, 0.77714596145697, 0.76604444311898, 0.75470958022277, 0.74314482547739, 0.73135370161917, 0.71933980033865, 0.70710678118655, 0.69465837045900, 0.68199836006250, 0.66913060635886, 0.65605902899051, 0.64278760968654, 0.62932039104984, 0.61566147532566, 0.60181502315205, 0.58778525229247, 0.57357643635105, 0.55919290347075, 0.54463903501503, 0.52991926423320, 0.51503807491005, 0.50000000000000, 0.48480962024634, 0.46947156278589, 0.45399049973955, 0.43837114678908, 0.42261826174070, 0.40673664307580, 0.39073112848927, 0.37460659341591, 0.35836794954530, 0.34202014332567, 0.32556815445716, 0.30901699437495, 0.29237170472274, 0.27563735581700, 0.25881904510252, 0.24192189559967, 0.22495105434387, 0.20791169081776, 0.19080899537654, 0.17364817766693, 0.15643446504023, 0.13917310096007, 0.12186934340515, 0.10452846326765, 0.08715574274766, 0.06975647374413, 0.05233595624294, 0.03489949670250, 0.01745240643728, 0.00000000000000, -0.01745240643728, -0.03489949670250, -0.05233595624294, -0.06975647374412, -0.08715574274766, -0.10452846326765, -0.12186934340515, -0.13917310096007, -0.15643446504023, -0.17364817766693, -0.19080899537654, -0.20791169081776, -0.22495105434386, -0.24192189559967, -0.25881904510252, -0.27563735581700, -0.29237170472274, -0.30901699437495, -0.32556815445716, -0.34202014332567, -0.35836794954530, -0.37460659341591, -0.39073112848927, -0.40673664307580, -0.42261826174070, -0.43837114678908, -0.45399049973955, -0.46947156278589, -0.48480962024634, -0.50000000000000, -0.51503807491005, -0.52991926423320, -0.54463903501503, -0.55919290347075, -0.57357643635105, -0.58778525229247, -0.60181502315205, -0.61566147532566, -0.62932039104984, -0.64278760968654, -0.65605902899051, -0.66913060635886, -0.68199836006250, -0.69465837045900, -0.70710678118655, -0.71933980033865, -0.73135370161917, -0.74314482547739, -0.75470958022277, -0.76604444311898, -0.77714596145697, -0.78801075360672, -0.79863551004729, -0.80901699437495, -0.81915204428899, -0.82903757255504, -0.83867056794542, -0.84804809615643, -0.85716730070211, -0.86602540378444, -0.87461970713940, -0.88294759285893, -0.89100652418837, -0.89879404629917, -0.90630778703665, -0.91354545764260, -0.92050485345244, -0.92718385456679, -0.93358042649720, -0.93969262078591, -0.94551857559932, -0.95105651629515, -0.95630475596304, -0.96126169593832, -0.96592582628907, -0.97029572627600, -0.97437006478524, -0.97814760073381, -0.98162718344766, -0.98480775301221, -0.98768834059514, -0.99026806874157, -0.99254615164132, -0.99452189536827, -0.99619469809175, -0.99756405025982, -0.99862953475457, -0.99939082701910, -0.99984769515639, -1.00000000000000, -0.99984769515639, -0.99939082701910, -0.99862953475457, -0.99756405025982, -0.99619469809175, -0.99452189536827, -0.99254615164132, -0.99026806874157, -0.98768834059514, -0.98480775301221, -0.98162718344766, -0.97814760073381, -0.97437006478524, -0.97029572627600, -0.96592582628907, -0.96126169593832, -0.95630475596304, -0.95105651629515, -0.94551857559932, -0.93969262078591, -0.93358042649720, -0.92718385456679, -0.92050485345244, -0.91354545764260, -0.90630778703665, -0.89879404629917, -0.89100652418837, -0.88294759285893, -0.87461970713940, -0.86602540378444, -0.85716730070211, -0.84804809615643, -0.83867056794542, -0.82903757255504, -0.81915204428899, -0.80901699437495, -0.79863551004729, -0.78801075360672, -0.77714596145697, -0.76604444311898, -0.75470958022277, -0.74314482547739, -0.73135370161917, -0.71933980033865, -0.70710678118655, -0.69465837045900, -0.68199836006250, -0.66913060635886, -0.65605902899051, -0.64278760968654, -0.62932039104984, -0.61566147532566, -0.60181502315205, -0.58778525229247, -0.57357643635105, -0.55919290347075, -0.54463903501503, -0.52991926423321, -0.51503807491005, -0.50000000000000, -0.48480962024634, -0.46947156278589, -0.45399049973955, -0.43837114678908, -0.42261826174070, -0.40673664307580, -0.39073112848927, -0.37460659341591, -0.35836794954530, -0.34202014332567, -0.32556815445716, -0.30901699437495, -0.29237170472274, -0.27563735581700, -0.25881904510252, -0.24192189559967, -0.22495105434387, -0.20791169081776, -0.19080899537654, -0.17364817766693, -0.15643446504023, -0.13917310096007, -0.12186934340515, -0.10452846326765, -0.08715574274766, -0.06975647374413, -0.05233595624294, -0.03489949670250, -0.01745240643728, 0, 0 }; [L148] double a, aa, r; [L150] a = -360 VAL [T={4:0}] [L150] COND TRUE a <= 360 [L151] aa = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not(aa >= a / 2. && aa <= (a+1.) / 2.) [L15] COND FALSE !(!cond) [L152] RET assume_abort_if_not(aa >= a / 2. && aa <= (a+1.) / 2.) [L154] CALL, EXPR SIN(aa) VAL [\old(x)=2904, T={4:0}] [L142] COND FALSE !(x<0) VAL [\old(x)=2904, T={4:0}, x=2904] [L143] CALL, EXPR SIN_POS(x) VAL [\old(x)=2904, T={4:0}] [L136] COND TRUE x>180 VAL [\old(x)=2904, T={4:0}, x=2904] [L136] CALL, EXPR SIN_180(x-360.*(int)((x+180.)/360.)) VAL [T={4:0}] [L130] COND TRUE x<0 VAL [\old(x)=2905, T={4:0}, x=2905] [L130] CALL, EXPR SIN_0_180(-x) VAL [T={4:0}] [L117] double dx, i_dx, v_inf; [L118] double v_sup; [L119] int i; [L120] dx = 2*x [L121] i = dx [L122] i_dx = i [L123] EXPR T[i] [L123] v_inf = T[i] [L124] EXPR T[i+1] [L124] v_sup = T[i+1] [L125] return v_inf + (dx - i_dx) * (v_sup - v_inf); [L130] RET, EXPR SIN_0_180(-x) VAL [\old(x)=2905, SIN_0_180(-x)=2909, T={4:0}, x=2905] [L130] return -SIN_0_180(-x); [L136] RET, EXPR SIN_180(x-360.*(int)((x+180.)/360.)) VAL [\old(x)=2904, SIN_180(x-360.*(int)((x+180.)/360.))=2898, T={4:0}, x=2904] [L136] return SIN_180(x-360.*(int)((x+180.)/360.)); [L143] RET, EXPR SIN_POS(x) VAL [\old(x)=2904, SIN_POS(x)=2898, T={4:0}, x=2904] [L143] return SIN_POS(x); [L154] RET, EXPR SIN(aa) VAL [a=2904, SIN(aa)=2898, T={4:0}] [L154] CALL, EXPR SIN(-aa) VAL [T={4:0}] [L142] COND FALSE !(x<0) VAL [\old(x)=2907, T={4:0}, x=2907] [L143] CALL, EXPR SIN_POS(x) VAL [\old(x)=2907, T={4:0}] [L136] COND TRUE x>180 VAL [\old(x)=2907, T={4:0}, x=2907] [L136] CALL, EXPR SIN_180(x-360.*(int)((x+180.)/360.)) VAL [T={4:0}] [L130] COND TRUE x<0 VAL [\old(x)=2897, T={4:0}, x=2897] [L130] CALL, EXPR SIN_0_180(-x) VAL [T={4:0}] [L117] double dx, i_dx, v_inf; [L118] double v_sup; [L119] int i; [L120] dx = 2*x [L121] i = dx [L122] i_dx = i [L123] EXPR T[i] [L123] v_inf = T[i] [L124] EXPR T[i+1] [L124] v_sup = T[i+1] [L125] return v_inf + (dx - i_dx) * (v_sup - v_inf); [L130] RET, EXPR SIN_0_180(-x) VAL [\old(x)=2897, SIN_0_180(-x)=2908, T={4:0}, x=2897] [L130] return -SIN_0_180(-x); [L136] RET, EXPR SIN_180(x-360.*(int)((x+180.)/360.)) VAL [\old(x)=2907, SIN_180(x-360.*(int)((x+180.)/360.))=2910, T={4:0}, x=2907] [L136] return SIN_180(x-360.*(int)((x+180.)/360.)); [L143] RET, EXPR SIN_POS(x) VAL [\old(x)=2907, SIN_POS(x)=2910, T={4:0}, x=2907] [L143] return SIN_POS(x); [L154] RET, EXPR SIN(-aa) VAL [a=2904, SIN(-aa)=2910, SIN(aa)=2898, T={4:0}] [L154] r = SIN(aa) + SIN(-aa) [L156] CALL __VERIFIER_assert(r >= -0.06 && r <= 0.06) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, T={4:0}] [L17] reach_error() VAL [\old(cond)=0, cond=0, T={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 01:58:20,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sin_interpolated_negation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/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 9fc903c4e042f1a917ff23806dc398a0ae6250449674c68af7855fc8b73da478 --- 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 01:58:23,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:58:23,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:58:23,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:58:23,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:58:23,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:58:23,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:58:23,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:58:23,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:58:23,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:58:23,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:58:23,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:58:23,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:58:23,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:58:23,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:58:23,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:58:23,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:58:23,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:58:23,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:58:23,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:58:23,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:58:23,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:58:23,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:58:23,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:58:23,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:58:23,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:58:23,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:58:23,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:58:23,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:58:23,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:58:23,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:58:23,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:58:23,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:58:23,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:58:23,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:58:23,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:58:23,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:58:23,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:58:23,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:58:23,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:58:23,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:58:23,084 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 01:58:23,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:58:23,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:58:23,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:58:23,141 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:58:23,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:58:23,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:58:23,143 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:58:23,143 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:58:23,143 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:58:23,144 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:58:23,145 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:58:23,145 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:58:23,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:58:23,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:58:23,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:58:23,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:58:23,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:58:23,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:58:23,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:58:23,148 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:58:23,148 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 01:58:23,148 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 01:58:23,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:58:23,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:58:23,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:58:23,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:58:23,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:58:23,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 01:58:23,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:58:23,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:23,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:58:23,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:58:23,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:58:23,151 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 01:58:23,151 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 01:58:23,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:58:23,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:58:23,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 01:58:23,153 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_8c5089f5-99ed-4378-9022-1dc9454d00ed/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_8c5089f5-99ed-4378-9022-1dc9454d00ed/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 -> 9fc903c4e042f1a917ff23806dc398a0ae6250449674c68af7855fc8b73da478 [2022-11-03 01:58:23,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:58:23,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:58:23,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:58:23,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:58:23,584 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:58:23,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/sin_interpolated_negation.c [2022-11-03 01:58:23,648 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/8678b699e/828983fa0f1240528bb6935330118c48/FLAG27f01697c [2022-11-03 01:58:24,192 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:58:24,193 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/sv-benchmarks/c/float-benchs/sin_interpolated_negation.c [2022-11-03 01:58:24,200 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/8678b699e/828983fa0f1240528bb6935330118c48/FLAG27f01697c [2022-11-03 01:58:24,555 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/data/8678b699e/828983fa0f1240528bb6935330118c48 [2022-11-03 01:58:24,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:58:24,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:58:24,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:24,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:58:24,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:58:24,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:24" (1/1) ... [2022-11-03 01:58:24,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca16238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:24, skipping insertion in model container [2022-11-03 01:58:24,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:24" (1/1) ... [2022-11-03 01:58:24,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:58:24,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:58:24,777 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_8c5089f5-99ed-4378-9022-1dc9454d00ed/sv-benchmarks/c/float-benchs/sin_interpolated_negation.c[684,697] [2022-11-03 01:58:24,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:24,979 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:58:24,996 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_8c5089f5-99ed-4378-9022-1dc9454d00ed/sv-benchmarks/c/float-benchs/sin_interpolated_negation.c[684,697] [2022-11-03 01:58:25,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:25,124 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:58:25,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25 WrapperNode [2022-11-03 01:58:25,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:25,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:25,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:58:25,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:58:25,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,242 INFO L138 Inliner]: procedures = 22, calls = 382, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 406 [2022-11-03 01:58:25,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:25,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:58:25,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:58:25,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:58:25,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:58:25,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:58:25,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:58:25,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:58:25,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (1/1) ... [2022-11-03 01:58:25,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:25,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:25,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:58:25,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:58:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:58:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-11-03 01:58:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure SIN_POS [2022-11-03 01:58:25,475 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN_POS [2022-11-03 01:58:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 01:58:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure SIN_0_180 [2022-11-03 01:58:25,476 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN_0_180 [2022-11-03 01:58:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure SIN_180 [2022-11-03 01:58:25,476 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN_180 [2022-11-03 01:58:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-11-03 01:58:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure SIN [2022-11-03 01:58:25,477 INFO L138 BoogieDeclarations]: Found implementation of procedure SIN [2022-11-03 01:58:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:58:25,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:58:25,595 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:58:25,597 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:58:31,361 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:58:31,368 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:58:31,368 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:58:31,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:31 BoogieIcfgContainer [2022-11-03 01:58:31,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:58:31,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:58:31,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:58:31,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:58:31,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:58:24" (1/3) ... [2022-11-03 01:58:31,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777b98d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:58:31, skipping insertion in model container [2022-11-03 01:58:31,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:25" (2/3) ... [2022-11-03 01:58:31,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777b98d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:58:31, skipping insertion in model container [2022-11-03 01:58:31,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:31" (3/3) ... [2022-11-03 01:58:31,379 INFO L112 eAbstractionObserver]: Analyzing ICFG sin_interpolated_negation.c [2022-11-03 01:58:31,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:58:31,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:58:31,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:58:31,461 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;@606ebe11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:58:31,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:58:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:58:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 01:58:31,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:31,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:31,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1228543863, now seen corresponding path program 1 times [2022-11-03 01:58:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:58:31,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053359782] [2022-11-03 01:58:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:58:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:58:31,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:58:31,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 01:58:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:35,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 01:58:35,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:58:35,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:58:35,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:58:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053359782] [2022-11-03 01:58:35,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053359782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:35,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:35,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:58:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191399963] [2022-11-03 01:58:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:35,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 01:58:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:58:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 01:58:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:58:35,589 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:58:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:35,613 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-11-03 01:58:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 01:58:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-11-03 01:58:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:35,622 INFO L225 Difference]: With dead ends: 86 [2022-11-03 01:58:35,622 INFO L226 Difference]: Without dead ends: 40 [2022-11-03 01:58:35,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:58:35,629 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:35,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:58:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-03 01:58:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-03 01:58:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:58:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-03 01:58:35,669 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 52 [2022-11-03 01:58:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:35,669 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-03 01:58:35,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:58:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-03 01:58:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 01:58:35,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:35,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:35,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 01:58:35,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:58:35,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1021623079, now seen corresponding path program 1 times [2022-11-03 01:58:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:58:35,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687394437] [2022-11-03 01:58:35,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:58:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:58:35,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:58:35,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 01:58:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:39,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 01:58:39,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:52,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (and (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0) .cse1)) (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (not (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (not (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0) .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2022-11-03 01:59:03,453 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) is different from true [2022-11-03 01:59:22,755 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0))))) is different from true [2022-11-03 01:59:33,074 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0))))) (= c_SIN_~x |c_SIN_#in~x|)) is different from false [2022-11-03 01:59:59,532 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0))))) (= |c_SIN_POS_#in~x| c_SIN_POS_~x)) is different from false [2022-11-03 02:00:25,711 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_SIN_180_#in~x| c_SIN_180_~x) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)))))) is different from false [2022-11-03 02:00:36,094 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0))))) (fp.lt |c_SIN_180_#in~x| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-11-03 02:00:46,243 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)))))) is different from false [2022-11-03 02:00:48,286 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)))))) is different from true [2022-11-03 02:01:11,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse1))))) (fp.lt |c_SIN_180_#in~x| .cse0))) is different from false [2022-11-03 02:01:35,320 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (fp.lt |c_SIN_POS_#in~x| .cse0) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse1))))))) is different from false [2022-11-03 02:02:02,406 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (fp.lt |c_SIN_#in~x| .cse0) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)) (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse1))))))) is different from false [2022-11-03 02:02:36,468 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.lt |c_ULTIMATE.start_main_~aa~0#1| .cse0) (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:02:59,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:03:01,049 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from true [2022-11-03 02:03:23,975 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (= c_SIN_~x |c_SIN_#in~x|) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:04:26,901 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (= |c_SIN_POS_#in~x| c_SIN_POS_~x) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:05:30,183 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (= |c_SIN_180_#in~x| c_SIN_180_~x) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:05:50,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))) (fp.lt |c_SIN_180_#in~x| .cse0))) is different from false [2022-11-03 02:06:12,960 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_SIN_180_#in~x_BEFORE_CALL_2| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_2| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:06:15,002 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_SIN_180_#in~x_BEFORE_CALL_2| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_2| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from true [2022-11-03 02:07:18,213 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_SIN_180_#in~x_BEFORE_CALL_2| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_2| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))) (fp.lt |c_SIN_180_#in~x| .cse0))) is different from false [2022-11-03 02:08:19,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (exists ((|v_SIN_180_#in~x_BEFORE_CALL_2| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_2| .cse0)) (fp.lt |c_SIN_POS_#in~x| .cse0) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:09:23,104 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (exists ((|v_SIN_180_#in~x_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_1| .cse0)) (fp.lt |c_SIN_#in~x| .cse0) (exists ((|v_SIN_180_#in~x_BEFORE_CALL_2| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_180_#in~x_BEFORE_CALL_2| .cse0)) (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse2)) (fp.lt |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_2| .cse0))) (exists ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse1) .cse2)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| .cse2)))))) is different from false [2022-11-03 02:10:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-11-03 02:10:03,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:05,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:10:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687394437] [2022-11-03 02:10:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687394437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:10:05,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1349192192] [2022-11-03 02:10:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:10:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:10:05,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:10:05,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-11-03 02:10:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:19,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:10:19,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:10:20,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:10:20,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1349192192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:10:20,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:10:20,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 28 [2022-11-03 02:10:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110670657] [2022-11-03 02:10:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:10:20,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:10:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:10:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:10:20,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=89, Unknown=24, NotChecked=756, Total=930 [2022-11-03 02:10:20,843 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:10:23,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:24,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:27,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:29,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:31,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:33,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:35,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:37,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:40,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:42,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:44,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:45,491 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-11-03 02:10:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:10:45,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-11-03 02:10:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:45,503 INFO L225 Difference]: With dead ends: 88 [2022-11-03 02:10:45,503 INFO L226 Difference]: Without dead ends: 50 [2022-11-03 02:10:45,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 53.7s TimeCoverageRelationStatistics Valid=69, Invalid=123, Unknown=24, NotChecked=840, Total=1056 [2022-11-03 02:10:45,506 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:45,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 164 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 24.4s Time] [2022-11-03 02:10:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-03 02:10:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-03 02:10:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-03 02:10:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-11-03 02:10:45,517 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 52 [2022-11-03 02:10:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:45,518 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-11-03 02:10:45,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:10:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-11-03 02:10:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 02:10:45,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:45,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:45,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:45,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:45,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:10:45,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1291190553, now seen corresponding path program 1 times [2022-11-03 02:10:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:10:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280699032] [2022-11-03 02:10:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:10:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:10:45,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:10:45,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:10:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:50,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:10:50,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:52,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:10:52,378 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:10:52,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280699032] [2022-11-03 02:10:52,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280699032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:10:52,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:10:52,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:10:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556695261] [2022-11-03 02:10:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:10:52,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:10:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:10:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:10:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:10:52,381 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:10:53,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:55,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:56,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:07,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:09,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:11,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:13,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:15,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:17,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:19,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:21,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:24,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:26,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:11:30,156 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 02:11:32,732 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 02:11:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:32,732 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2022-11-03 02:11:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:11:32,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-11-03 02:11:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:32,790 INFO L225 Difference]: With dead ends: 137 [2022-11-03 02:11:32,790 INFO L226 Difference]: Without dead ends: 91 [2022-11-03 02:11:32,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:11:32,791 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 59 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 19 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:32,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 189 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 196 Invalid, 11 Unknown, 0 Unchecked, 33.0s Time] [2022-11-03 02:11:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-03 02:11:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-11-03 02:11:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-03 02:11:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-11-03 02:11:32,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 52 [2022-11-03 02:11:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:32,807 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-11-03 02:11:32,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:11:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-11-03 02:11:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 02:11:32,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:32,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:32,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-03 02:11:33,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:11:33,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:11:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1929302137, now seen corresponding path program 1 times [2022-11-03 02:11:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:11:33,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393832801] [2022-11-03 02:11:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:11:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:11:33,022 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:11:33,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c5089f5-99ed-4378-9022-1dc9454d00ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:11:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:37,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:11:37,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:51,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (and (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0) .cse1)) (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (not (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse1)))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (not (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0) .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2022-11-03 02:12:01,865 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) is different from false [2022-11-03 02:12:03,916 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |c_ULTIMATE.start_main_~aa~0#1| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) is different from true [2022-11-03 02:12:22,558 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) is different from false [2022-11-03 02:12:24,602 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) is different from true [2022-11-03 02:12:34,988 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) (= c_SIN_~x |c_SIN_#in~x|)) is different from false [2022-11-03 02:12:45,420 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) (fp.lt c_SIN_~x ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_SIN_~x |c_SIN_#in~x|)) is different from false [2022-11-03 02:12:54,655 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_#in~x_BEFORE_CALL_4| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_#in~x_BEFORE_CALL_4| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)))))) is different from true [2022-11-03 02:13:05,081 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_#in~x_BEFORE_CALL_4| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_#in~x_BEFORE_CALL_4| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0))))) (= |c_SIN_POS_#in~x| c_SIN_POS_~x)) is different from false [2022-11-03 02:13:15,510 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_#in~x_BEFORE_CALL_4| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_#in~x_BEFORE_CALL_4| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.gt |c_SIN_POS_#in~x| ((_ to_fp 11 53) c_currentRoundingMode (_ bv180 32))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)))))) is different from false [2022-11-03 02:13:25,909 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_#in~x_BEFORE_CALL_4| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_#in~x_BEFORE_CALL_4| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (exists ((|v_SIN_POS_#in~x_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (fp.gt |v_SIN_POS_#in~x_BEFORE_CALL_5| ((_ to_fp 11 53) c_currentRoundingMode (_ bv180 32)))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)))))) is different from false [2022-11-03 02:13:27,958 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_SIN_#in~x_BEFORE_CALL_4| (_ FloatingPoint 11 53))) (fp.lt |v_SIN_#in~x_BEFORE_CALL_4| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (exists ((|v_SIN_POS_#in~x_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (fp.gt |v_SIN_POS_#in~x_BEFORE_CALL_5| ((_ to_fp 11 53) c_currentRoundingMode (_ bv180 32)))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~aa~0#1_BEFORE_CALL_5| (fp.div c_currentRoundingMode |ULTIMATE.start_main_~a~0#1| .cse0)))))) is different from true