./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:40:34,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:40:34,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:40:34,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:40:34,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:40:34,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:40:34,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:40:34,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:40:34,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:40:34,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:40:34,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:40:34,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:40:34,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:40:34,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:40:34,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:40:34,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:40:34,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:40:34,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:40:34,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:40:34,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:40:34,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:40:34,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:40:34,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:40:34,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:40:34,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:40:34,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:40:34,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:40:34,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:40:34,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:40:34,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:40:34,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:40:34,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:40:34,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:40:34,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:40:34,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:40:34,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:40:34,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:40:34,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:40:34,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:40:34,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:40:34,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:40:34,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:40:34,350 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:40:34,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:40:34,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:40:34,351 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:40:34,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:40:34,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:40:34,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:40:34,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:40:34,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:40:34,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:40:34,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:40:34,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:40:34,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:40:34,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:40:34,355 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:40:34,355 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_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/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_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-12-06 17:40:34,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:40:34,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:40:34,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:40:34,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:40:34,560 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:40:34,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-12-06 17:40:34,614 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/5b2d026b3/394b274bd97e44f2aca65aaf103544e1/FLAGa9f64cfdf [2021-12-06 17:40:34,982 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:40:34,983 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-12-06 17:40:34,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/5b2d026b3/394b274bd97e44f2aca65aaf103544e1/FLAGa9f64cfdf [2021-12-06 17:40:34,996 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/5b2d026b3/394b274bd97e44f2aca65aaf103544e1 [2021-12-06 17:40:34,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:40:34,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:40:35,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:40:35,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:40:35,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:40:35,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:34" (1/1) ... [2021-12-06 17:40:35,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9202047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35, skipping insertion in model container [2021-12-06 17:40:35,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:34" (1/1) ... [2021-12-06 17:40:35,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:40:35,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:40:35,149 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_7150bd5f-aedf-4a1a-bce5-7fb417907590/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-12-06 17:40:35,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:40:35,159 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:40:35,170 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_7150bd5f-aedf-4a1a-bce5-7fb417907590/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-12-06 17:40:35,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:40:35,181 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:40:35,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35 WrapperNode [2021-12-06 17:40:35,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:40:35,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:40:35,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:40:35,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:40:35,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,205 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-12-06 17:40:35,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:40:35,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:40:35,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:40:35,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:40:35,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:40:35,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:40:35,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:40:35,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:40:35,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (1/1) ... [2021-12-06 17:40:35,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:40:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:35,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:40:35,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:40:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:40:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:40:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:40:35,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:40:35,325 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:40:35,326 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:40:35,398 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:40:35,404 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:40:35,404 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 17:40:35,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:35 BoogieIcfgContainer [2021-12-06 17:40:35,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:40:35,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:40:35,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:40:35,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:40:35,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:40:34" (1/3) ... [2021-12-06 17:40:35,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30672721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:35, skipping insertion in model container [2021-12-06 17:40:35,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:35" (2/3) ... [2021-12-06 17:40:35,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30672721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:35, skipping insertion in model container [2021-12-06 17:40:35,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:35" (3/3) ... [2021-12-06 17:40:35,414 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-12-06 17:40:35,419 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:40:35,419 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:40:35,455 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:40:35,460 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:40:35,461 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:40:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:35,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:35,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:35,476 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2021-12-06 17:40:35,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:35,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150254993] [2021-12-06 17:40:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:35,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:35,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:35,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150254993] [2021-12-06 17:40:35,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150254993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:35,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:35,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:40:35,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211967824] [2021-12-06 17:40:35,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:35,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:40:35,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:40:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:40:35,638 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:35,659 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2021-12-06 17:40:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:40:35,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 17:40:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:35,667 INFO L225 Difference]: With dead ends: 40 [2021-12-06 17:40:35,667 INFO L226 Difference]: Without dead ends: 15 [2021-12-06 17:40:35,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:40:35,672 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:35,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:40:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-06 17:40:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-06 17:40:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-12-06 17:40:35,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2021-12-06 17:40:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:35,696 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-12-06 17:40:35,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-12-06 17:40:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:35,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:35,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:35,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:40:35,698 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2021-12-06 17:40:35,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:35,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052960752] [2021-12-06 17:40:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:35,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:35,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:35,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052960752] [2021-12-06 17:40:35,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052960752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:35,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:35,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:40:35,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318748022] [2021-12-06 17:40:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:35,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:40:35,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:35,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:40:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:35,750 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:35,811 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-12-06 17:40:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:40:35,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 17:40:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:35,812 INFO L225 Difference]: With dead ends: 36 [2021-12-06 17:40:35,813 INFO L226 Difference]: Without dead ends: 34 [2021-12-06 17:40:35,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:40:35,815 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:35,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:40:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-06 17:40:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2021-12-06 17:40:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-12-06 17:40:35,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-12-06 17:40:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:35,822 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-06 17:40:35,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-12-06 17:40:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:35,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:35,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:35,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:40:35,824 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:35,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:35,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2021-12-06 17:40:35,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:35,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811424616] [2021-12-06 17:40:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:35,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:40:35,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:40:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:40:35,864 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:40:35,865 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:40:35,865 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:40:35,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:40:35,869 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-06 17:40:35,872 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:40:35,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:40:35 BoogieIcfgContainer [2021-12-06 17:40:35,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:40:35,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:40:35,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:40:35,891 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:40:35,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:35" (3/4) ... [2021-12-06 17:40:35,894 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:40:35,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:40:35,895 INFO L158 Benchmark]: Toolchain (without parser) took 895.26ms. Allocated memory is still 107.0MB. Free memory was 70.8MB in the beginning and 77.9MB in the end (delta: -7.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:40:35,895 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:40:35,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.77ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 82.2MB in the end (delta: -11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:40:35,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.74ms. Allocated memory is still 107.0MB. Free memory was 82.2MB in the beginning and 80.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:40:35,896 INFO L158 Benchmark]: Boogie Preprocessor took 13.54ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:40:35,897 INFO L158 Benchmark]: RCFGBuilder took 186.30ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 70.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:40:35,897 INFO L158 Benchmark]: TraceAbstraction took 483.06ms. Allocated memory is still 107.0MB. Free memory was 70.2MB in the beginning and 78.5MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:40:35,897 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 77.9MB in the end (delta: 562.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:40:35,899 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.21ms. Allocated memory is still 107.0MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.77ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 82.2MB in the end (delta: -11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.74ms. Allocated memory is still 107.0MB. Free memory was 82.2MB in the beginning and 80.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.54ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 186.30ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 70.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 483.06ms. Allocated memory is still 107.0MB. Free memory was 70.2MB in the beginning and 78.5MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 77.9MB in the end (delta: 562.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 56]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__E0=49, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=49, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__i=0] [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L56] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 52 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-06 17:40:35,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:40:37,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:40:37,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:40:37,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:40:37,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:40:37,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:40:37,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:40:37,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:40:37,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:40:37,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:40:37,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:40:37,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:40:37,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:40:37,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:40:37,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:40:37,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:40:37,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:40:37,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:40:37,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:40:37,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:40:37,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:40:37,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:40:37,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:40:37,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:40:37,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:40:37,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:40:37,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:40:37,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:40:37,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:40:37,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:40:37,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:40:37,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:40:37,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:40:37,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:40:37,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:40:37,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:40:37,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:40:37,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:40:37,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:40:37,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:40:37,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:40:37,736 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-06 17:40:37,755 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:40:37,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:40:37,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:40:37,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:40:37,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:40:37,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:40:37,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:40:37,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:40:37,757 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:40:37,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:40:37,758 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:40:37,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:40:37,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:40:37,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:40:37,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:40:37,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:40:37,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:40:37,760 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:40:37,760 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:40:37,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:40:37,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:40:37,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:40:37,761 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:40:37,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:40:37,761 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_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/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_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-12-06 17:40:38,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:40:38,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:40:38,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:40:38,028 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:40:38,028 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:40:38,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-12-06 17:40:38,081 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/876e1d384/a7f27e9e41f24168b091288b5112fc34/FLAG931aa89ab [2021-12-06 17:40:38,478 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:40:38,478 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-12-06 17:40:38,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/876e1d384/a7f27e9e41f24168b091288b5112fc34/FLAG931aa89ab [2021-12-06 17:40:38,496 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/data/876e1d384/a7f27e9e41f24168b091288b5112fc34 [2021-12-06 17:40:38,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:40:38,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:40:38,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:40:38,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:40:38,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:40:38,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fa1cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38, skipping insertion in model container [2021-12-06 17:40:38,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:40:38,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:40:38,633 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_7150bd5f-aedf-4a1a-bce5-7fb417907590/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-12-06 17:40:38,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:40:38,654 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:40:38,682 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_7150bd5f-aedf-4a1a-bce5-7fb417907590/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-12-06 17:40:38,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:40:38,698 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:40:38,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38 WrapperNode [2021-12-06 17:40:38,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:40:38,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:40:38,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:40:38,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:40:38,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,731 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-12-06 17:40:38,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:40:38,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:40:38,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:40:38,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:40:38,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:40:38,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:40:38,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:40:38,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:40:38,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (1/1) ... [2021-12-06 17:40:38,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:40:38,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:38,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:40:38,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:40:38,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:40:38,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:40:38,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:40:38,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:40:38,855 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:40:38,857 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:40:40,990 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:40:40,994 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:40:40,995 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 17:40:40,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:40 BoogieIcfgContainer [2021-12-06 17:40:40,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:40:40,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:40:40,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:40:41,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:40:41,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:40:38" (1/3) ... [2021-12-06 17:40:41,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330d7ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:41, skipping insertion in model container [2021-12-06 17:40:41,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:38" (2/3) ... [2021-12-06 17:40:41,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330d7ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:41, skipping insertion in model container [2021-12-06 17:40:41,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:40" (3/3) ... [2021-12-06 17:40:41,002 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-12-06 17:40:41,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:40:41,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:40:41,047 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:40:41,054 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:40:41,054 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:40:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:41,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:41,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:41,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2021-12-06 17:40:41,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:40:41,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33650218] [2021-12-06 17:40:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:41,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:40:41,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:40:41,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:40:41,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:40:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:41,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:40:41,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:41,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:40:41,207 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:40:41,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33650218] [2021-12-06 17:40:41,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33650218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:41,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:41,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:40:41,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496862095] [2021-12-06 17:40:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:40:41,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:40:41,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:40:41,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:40:41,241 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:41,439 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2021-12-06 17:40:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:40:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 17:40:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:41,446 INFO L225 Difference]: With dead ends: 40 [2021-12-06 17:40:41,446 INFO L226 Difference]: Without dead ends: 15 [2021-12-06 17:40:41,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:40:41,451 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:41,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:40:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-06 17:40:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-06 17:40:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-12-06 17:40:41,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2021-12-06 17:40:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:41,477 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-12-06 17:40:41,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-12-06 17:40:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:41,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:41,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:41,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:40:41,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:40:41,679 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2021-12-06 17:40:41,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:40:41,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084535091] [2021-12-06 17:40:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:41,683 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:40:41,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:40:41,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:40:41,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:40:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:41,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:40:41,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:41,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:40:41,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:40:41,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084535091] [2021-12-06 17:40:41,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084535091] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:41,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:41,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:40:41,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493954999] [2021-12-06 17:40:41,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:41,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:40:41,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:40:41,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:40:41,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:40:41,789 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:41,879 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2021-12-06 17:40:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:40:41,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 17:40:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:41,881 INFO L225 Difference]: With dead ends: 30 [2021-12-06 17:40:41,881 INFO L226 Difference]: Without dead ends: 28 [2021-12-06 17:40:41,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:41,882 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:41,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-06 17:40:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2021-12-06 17:40:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-12-06 17:40:41,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-12-06 17:40:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:41,887 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-06 17:40:41,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-12-06 17:40:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:41,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:41,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:41,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-06 17:40:42,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:40:42,090 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:42,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2021-12-06 17:40:42,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:40:42,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451121627] [2021-12-06 17:40:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:42,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:40:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:40:42,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:40:42,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:40:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:42,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:40:42,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:42,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:40:42,274 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:40:42,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451121627] [2021-12-06 17:40:42,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451121627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:42,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:42,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:40:42,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321795451] [2021-12-06 17:40:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:42,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:40:42,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:40:42,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:40:42,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:40:42,276 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:42,771 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2021-12-06 17:40:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:40:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 17:40:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:42,773 INFO L225 Difference]: With dead ends: 42 [2021-12-06 17:40:42,773 INFO L226 Difference]: Without dead ends: 27 [2021-12-06 17:40:42,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:40:42,774 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:42,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:40:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-06 17:40:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2021-12-06 17:40:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-12-06 17:40:42,778 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-12-06 17:40:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:42,778 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-12-06 17:40:42,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-12-06 17:40:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:40:42,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:42,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:42,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:40:42,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:40:42,981 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2021-12-06 17:40:42,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:40:42,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018353314] [2021-12-06 17:40:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:42,986 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:40:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:40:42,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:40:42,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:40:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:43,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:40:43,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:43,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:40:43,820 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:40:43,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018353314] [2021-12-06 17:40:43,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018353314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:43,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:43,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:43,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084099338] [2021-12-06 17:40:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:43,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:40:43,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:40:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:40:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:40:43,821 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:46,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:40:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:46,588 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2021-12-06 17:40:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:40:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 17:40:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:46,589 INFO L225 Difference]: With dead ends: 47 [2021-12-06 17:40:46,589 INFO L226 Difference]: Without dead ends: 29 [2021-12-06 17:40:46,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:40:46,590 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:46,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 1 Unknown, 10 Unchecked, 2.8s Time] [2021-12-06 17:40:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-06 17:40:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-06 17:40:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-06 17:40:46,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2021-12-06 17:40:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:46,595 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-06 17:40:46,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-06 17:40:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-06 17:40:46,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:46,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:46,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-06 17:40:46,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:40:46,798 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1249715145, now seen corresponding path program 1 times [2021-12-06 17:40:46,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:40:46,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376343944] [2021-12-06 17:40:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:46,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:40:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:40:46,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:40:46,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:40:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:40:47,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:47,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:40:47,680 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:40:47,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376343944] [2021-12-06 17:40:47,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376343944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:47,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:47,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:47,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235512892] [2021-12-06 17:40:47,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:47,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:40:47,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:40:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:40:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:40:47,681 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:50,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:40:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:50,760 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-12-06 17:40:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:40:50,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-06 17:40:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:50,763 INFO L225 Difference]: With dead ends: 49 [2021-12-06 17:40:50,763 INFO L226 Difference]: Without dead ends: 31 [2021-12-06 17:40:50,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:40:50,764 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:50,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 1 Unknown, 4 Unchecked, 3.1s Time] [2021-12-06 17:40:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-06 17:40:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2021-12-06 17:40:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-06 17:40:50,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2021-12-06 17:40:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:50,769 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-06 17:40:50,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-12-06 17:40:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 17:40:50,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:50,770 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:50,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 17:40:50,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:40:50,971 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2021-12-06 17:40:50,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:40:50,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86812221] [2021-12-06 17:40:50,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:50,975 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:40:50,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:40:50,978 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:40:50,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 17:40:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:40:51,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:08,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:16,721 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-12-06 17:41:18,759 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-12-06 17:41:33,099 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-12-06 17:41:35,144 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-12-06 17:41:49,544 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-12-06 17:43:05,758 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) is different from true [2021-12-06 17:43:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-06 17:43:12,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:12,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86812221] [2021-12-06 17:43:12,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86812221] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:12,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:12,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-12-06 17:43:12,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518681711] [2021-12-06 17:43:12,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:12,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-06 17:43:12,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-06 17:43:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=81, Unknown=9, NotChecked=92, Total=240 [2021-12-06 17:43:12,877 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:15,385 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse2)))))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 17:43:18,054 WARN L534 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 [] [2021-12-06 17:43:24,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:43:26,607 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 17:43:28,713 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 17:43:30,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-12-06 17:43:32,865 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-12-06 17:43:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:32,867 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2021-12-06 17:43:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:43:32,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 17:43:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:32,868 INFO L225 Difference]: With dead ends: 67 [2021-12-06 17:43:32,868 INFO L226 Difference]: Without dead ends: 49 [2021-12-06 17:43:32,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=78, Invalid=99, Unknown=15, NotChecked=270, Total=462 [2021-12-06 17:43:32,869 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:32,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 1 Unknown, 157 Unchecked, 2.8s Time] [2021-12-06 17:43:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-06 17:43:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2021-12-06 17:43:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-12-06 17:43:32,876 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2021-12-06 17:43:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:32,876 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-12-06 17:43:32,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-12-06 17:43:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 17:43:32,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:32,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:32,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 17:43:33,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:33,079 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2021-12-06 17:43:33,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:33,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891036459] [2021-12-06 17:43:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:33,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:33,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:33,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:33,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 17:43:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:34,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 17:43:34,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:22,521 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:45:50,958 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2021-12-06 17:45:52,984 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2021-12-06 17:48:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-06 17:48:07,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:48:13,237 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-12-06 17:48:15,289 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-12-06 17:48:29,445 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-12-06 17:48:31,494 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-12-06 17:48:45,928 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-12-06 17:49:37,615 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-12-06 17:49:52,108 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse1))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2021-12-06 17:50:06,582 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse0))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse1)))))))) is different from true [2021-12-06 17:50:29,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse3)))))))) is different from false [2021-12-06 17:50:31,895 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse3)))))))) is different from true [2021-12-06 17:51:20,508 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse3)))))))) is different from false [2021-12-06 17:51:22,619 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse3)))))))) is different from true [2021-12-06 17:52:28,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq .cse1 (fp.neg .cse2))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (not (fp.leq .cse1 .cse2)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse4))))))))) is different from false [2021-12-06 17:52:30,672 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq .cse1 (fp.neg .cse2))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (not (fp.leq .cse1 .cse2)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse4))))))))) is different from true [2021-12-06 17:54:30,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E0~0#1|) .cse3)))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) is different from false [2021-12-06 17:54:32,237 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E0~0#1|) .cse3)))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) is different from true [2021-12-06 17:54:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-12-06 17:54:32,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:54:32,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891036459] [2021-12-06 17:54:32,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891036459] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:54:32,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:54:32,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2021-12-06 17:54:32,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137870264] [2021-12-06 17:54:32,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:54:32,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:54:32,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:54:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:54:32,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=70, Unknown=19, NotChecked=348, Total=506 [2021-12-06 17:54:32,240 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:54:34,306 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E0~0#1|) .cse3)))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:54:36,370 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E0~0#1|) .cse3)))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-06 17:54:38,407 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (not (fp.leq .cse2 .cse3)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse5))))))))) (= .cse0 |c_ULTIMATE.start_main_~main__E1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:54:40,506 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (not (fp.leq .cse2 .cse3)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse5))))))))) (= .cse0 |c_ULTIMATE.start_main_~main__E1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:54:42,524 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse5)))))))))) is different from false [2021-12-06 17:54:44,630 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse5)))))))))) is different from true [2021-12-06 17:54:48,180 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse5)))))))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:54:50,250 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse1))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse2)))))))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse3) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3)) |c_ULTIMATE.start_main_~main__S~0#1|))) is different from true [2021-12-06 17:54:52,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse2))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__S~0#1| (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse3) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3))))) is different from false [2021-12-06 17:54:54,348 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse2))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__S~0#1| (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse3) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3))))) is different from true [2021-12-06 17:54:56,449 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__S~0#1| (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse2) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2))))) is different from true [2021-12-06 17:54:58,554 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__S~0#1| (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse2) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2))))) is different from true [2021-12-06 17:55:00,891 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__S~0#1| (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3)))))) is different from true [2021-12-06 17:55:03,196 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__S~0#1| (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3)))))) is different from true [2021-12-06 17:55:05,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:55:07,644 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0))))) (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:55:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:55:08,520 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2021-12-06 17:55:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:55:08,521 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 17:55:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:55:08,522 INFO L225 Difference]: With dead ends: 85 [2021-12-06 17:55:08,522 INFO L226 Difference]: Without dead ends: 58 [2021-12-06 17:55:08,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=91, Invalid=77, Unknown=34, NotChecked=920, Total=1122 [2021-12-06 17:55:08,523 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:55:08,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 1 Unknown, 309 Unchecked, 3.4s Time] [2021-12-06 17:55:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-06 17:55:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2021-12-06 17:55:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:55:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-06 17:55:08,529 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 23 [2021-12-06 17:55:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:55:08,530 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-06 17:55:08,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:55:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-06 17:55:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:55:08,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:55:08,531 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:55:08,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 17:55:08,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:55:08,732 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:55:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:55:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash -619393142, now seen corresponding path program 1 times [2021-12-06 17:55:08,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:55:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324457203] [2021-12-06 17:55:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:55:08,736 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:55:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:55:08,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:55:08,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7150bd5f-aedf-4a1a-bce5-7fb417907590/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 17:55:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:55:09,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 17:55:09,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:55:39,791 WARN L227 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 28 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:55:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:55:51,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:56:08,400 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from false