./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/drift_tenth.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:40:40,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:40:40,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:40:40,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:40:40,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:40:40,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:40:40,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:40:40,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:40:40,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:40:40,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:40:40,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:40:40,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:40:40,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:40:40,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:40:40,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:40:40,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:40:40,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:40:40,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:40:40,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:40:40,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:40:40,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:40:40,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:40:40,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:40:40,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:40:40,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:40:40,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:40:40,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:40:40,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:40:40,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:40:40,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:40:40,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:40:40,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:40:40,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:40:40,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:40:40,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:40:40,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:40:40,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:40:40,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:40:40,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:40:40,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:40:40,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:40:40,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:40:40,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:40:40,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:40:40,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:40:40,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:40:40,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:40:40,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:40:40,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:40:40,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:40:40,489 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:40:40,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:40:40,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:40:40,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:40:40,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:40:40,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:40:40,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:40:40,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:40:40,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:40:40,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:40:40,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:40:40,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:40:40,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:40:40,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:40:40,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:40:40,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:40:40,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:40:40,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:40:40,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:40:40,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:40:40,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:40:40,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:40:40,498 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:40:40,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:40:40,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:40:40,499 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_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/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_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2022-11-20 12:40:40,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:40:40,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:40:40,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:40:40,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:40:40,922 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:40:40,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-20 12:40:44,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:40:44,320 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:40:44,321 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-20 12:40:44,328 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data/7fe9fded0/d91bba0f7fb046e3a2c5bc45ed7cd37c/FLAG3169feaf6 [2022-11-20 12:40:44,345 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data/7fe9fded0/d91bba0f7fb046e3a2c5bc45ed7cd37c [2022-11-20 12:40:44,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:40:44,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:40:44,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:40:44,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:40:44,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:40:44,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab9953d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44, skipping insertion in model container [2022-11-20 12:40:44,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:40:44,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:40:44,526 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-20 12:40:44,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:40:44,553 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:40:44,568 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-20 12:40:44,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:40:44,587 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:40:44,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44 WrapperNode [2022-11-20 12:40:44,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:40:44,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:40:44,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:40:44,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:40:44,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,630 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-11-20 12:40:44,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:40:44,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:40:44,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:40:44,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:40:44,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:40:44,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:40:44,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:40:44,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:40:44,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (1/1) ... [2022-11-20 12:40:44,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:40:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:44,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:40:44,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:40:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:40:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:40:44,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:40:44,845 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:40:44,847 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:40:45,017 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:40:45,029 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:40:45,030 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:40:45,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:45 BoogieIcfgContainer [2022-11-20 12:40:45,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:40:45,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:40:45,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:40:45,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:40:45,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:40:44" (1/3) ... [2022-11-20 12:40:45,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6c9a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:40:45, skipping insertion in model container [2022-11-20 12:40:45,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:44" (2/3) ... [2022-11-20 12:40:45,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6c9a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:40:45, skipping insertion in model container [2022-11-20 12:40:45,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:45" (3/3) ... [2022-11-20 12:40:45,048 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2022-11-20 12:40:45,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:40:45,078 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:40:45,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:40:45,158 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f76e38d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:40:45,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:40:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 12:40:45,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:45,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:40:45,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-11-20 12:40:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:45,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513785749] [2022-11-20 12:40:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:45,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:45,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513785749] [2022-11-20 12:40:45,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513785749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:45,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:45,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024935527] [2022-11-20 12:40:45,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:45,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:45,504 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:45,563 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-11-20 12:40:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-20 12:40:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:45,585 INFO L225 Difference]: With dead ends: 22 [2022-11-20 12:40:45,585 INFO L226 Difference]: Without dead ends: 10 [2022-11-20 12:40:45,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:45,592 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:45,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-20 12:40:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-11-20 12:40:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-20 12:40:45,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-11-20 12:40:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:45,627 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-20 12:40:45,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-20 12:40:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 12:40:45,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:45,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:45,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:40:45,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-11-20 12:40:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:45,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666646082] [2022-11-20 12:40:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:45,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666646082] [2022-11-20 12:40:45,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666646082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:40:45,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597849376] [2022-11-20 12:40:45,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:45,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:45,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:45,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:40:45,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:40:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:45,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:40:45,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:45,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:40:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:45,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597849376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:40:45,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:40:45,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-20 12:40:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074333344] [2022-11-20 12:40:45,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:40:45,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:40:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:40:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:40:45,922 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:45,967 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-20 12:40:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:40:45,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 8 [2022-11-20 12:40:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:45,970 INFO L225 Difference]: With dead ends: 19 [2022-11-20 12:40:45,970 INFO L226 Difference]: Without dead ends: 15 [2022-11-20 12:40:45,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:40:45,972 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:45,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-20 12:40:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-20 12:40:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-20 12:40:45,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-20 12:40:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:45,978 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-20 12:40:45,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-20 12:40:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:40:45,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:45,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:45,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:46,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:46,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:46,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-11-20 12:40:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:46,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762614660] [2022-11-20 12:40:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:46,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:46,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762614660] [2022-11-20 12:40:46,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762614660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:40:46,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474525193] [2022-11-20 12:40:46,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:40:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:46,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:46,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:40:46,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:40:46,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:40:46,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:40:46,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:40:46,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:46,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:40:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474525193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:40:46,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:40:46,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-20 12:40:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893499049] [2022-11-20 12:40:46,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:40:46,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:40:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:40:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:40:46,572 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:46,637 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-20 12:40:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:40:46,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:40:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:46,638 INFO L225 Difference]: With dead ends: 31 [2022-11-20 12:40:46,638 INFO L226 Difference]: Without dead ends: 27 [2022-11-20 12:40:46,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:40:46,640 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:46,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-20 12:40:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-20 12:40:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-20 12:40:46,663 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-11-20 12:40:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:46,663 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-20 12:40:46,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-20 12:40:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:40:46,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:46,665 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:46,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:46,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:46,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2022-11-20 12:40:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:46,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564648649] [2022-11-20 12:40:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:40:46,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:40:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:40:46,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:40:46,924 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:40:46,925 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:40:46,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:40:46,930 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-20 12:40:46,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:40:46,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:40:46 BoogieIcfgContainer [2022-11-20 12:40:46,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:40:46,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:40:46,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:40:46,960 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:40:46,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:45" (3/4) ... [2022-11-20 12:40:46,965 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:40:46,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:40:46,966 INFO L158 Benchmark]: Toolchain (without parser) took 2616.54ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 81.6MB in the end (delta: 26.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-11-20 12:40:46,966 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:40:46,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.26ms. Allocated memory is still 138.4MB. Free memory was 107.6MB in the beginning and 97.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:40:46,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.52ms. Allocated memory is still 138.4MB. Free memory was 97.9MB in the beginning and 96.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:40:46,967 INFO L158 Benchmark]: Boogie Preprocessor took 38.17ms. Allocated memory is still 138.4MB. Free memory was 96.5MB in the beginning and 95.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:40:46,968 INFO L158 Benchmark]: RCFGBuilder took 361.27ms. Allocated memory is still 138.4MB. Free memory was 95.4MB in the beginning and 86.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:40:46,968 INFO L158 Benchmark]: TraceAbstraction took 1922.34ms. Allocated memory is still 138.4MB. Free memory was 85.7MB in the beginning and 82.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-11-20 12:40:46,969 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 138.4MB. Free memory was 82.3MB in the beginning and 81.6MB in the end (delta: 661.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:40:46,971 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.26ms. Allocated memory is still 138.4MB. Free memory was 107.6MB in the beginning and 97.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.52ms. Allocated memory is still 138.4MB. Free memory was 97.9MB in the beginning and 96.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.17ms. Allocated memory is still 138.4MB. Free memory was 96.5MB in the beginning and 95.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.27ms. Allocated memory is still 138.4MB. Free memory was 95.4MB in the beginning and 86.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1922.34ms. Allocated memory is still 138.4MB. Free memory was 85.7MB in the beginning and 82.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 138.4MB. Free memory was 82.3MB in the beginning and 81.6MB in the end (delta: 661.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6]: 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 17, overapproximation of someBinaryArithmeticFLOAToperation at line 15. Possible FailurePath: [L10] float tick = 1.f / 10.f; [L11] float time = 0.f; [L12] int i; [L14] i = 0 VAL [i=0, time=0] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=0] [L14] i++ VAL [i=1] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=1] [L14] i++ VAL [i=2] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=2] [L14] i++ VAL [i=3] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=3] [L14] i++ VAL [i=4] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=4] [L14] i++ VAL [i=5] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=5] [L14] i++ VAL [i=6] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=6] [L14] i++ VAL [i=7] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=7] [L14] i++ VAL [i=8] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=8] [L14] i++ VAL [i=9] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=9] [L14] i++ VAL [i=10] [L14] COND FALSE !(i < 10) VAL [i=10] [L17] CALL __VERIFIER_assert(time != 1.0) [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 22 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 12:40:46,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:40:49,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:40:49,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:40:49,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:40:49,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:40:49,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:40:49,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:40:49,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:40:49,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:40:49,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:40:49,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:40:49,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:40:49,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:40:49,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:40:49,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:40:49,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:40:49,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:40:49,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:40:49,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:40:49,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:40:49,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:40:49,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:40:49,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:40:49,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:40:49,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:40:49,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:40:49,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:40:49,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:40:49,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:40:49,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:40:49,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:40:49,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:40:49,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:40:49,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:40:49,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:40:49,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:40:49,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:40:49,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:40:49,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:40:49,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:40:49,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:40:49,683 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 12:40:49,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:40:49,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:40:49,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:40:49,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:40:49,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:40:49,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:40:49,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:40:49,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:40:49,732 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:40:49,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:40:49,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:40:49,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:40:49,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:40:49,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:40:49,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:40:49,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:40:49,734 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:40:49,734 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 12:40:49,738 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 12:40:49,738 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:40:49,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:40:49,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:40:49,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:40:49,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:40:49,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:40:49,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:40:49,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:40:49,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:40:49,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:40:49,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:40:49,743 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 12:40:49,743 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 12:40:49,743 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:40:49,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:40:49,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:40:49,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 12:40:49,745 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_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/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_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2022-11-20 12:40:50,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:40:50,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:40:50,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:40:50,235 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:40:50,235 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:40:50,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-20 12:40:53,502 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:40:53,691 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:40:53,691 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-20 12:40:53,702 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data/b5cf920b4/fbd5d18332f8476e8adb3fc2731cc780/FLAGadce03f61 [2022-11-20 12:40:53,731 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/data/b5cf920b4/fbd5d18332f8476e8adb3fc2731cc780 [2022-11-20 12:40:53,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:40:53,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:40:53,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:40:53,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:40:53,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:40:53,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:40:53" (1/1) ... [2022-11-20 12:40:53,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4920ee5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:53, skipping insertion in model container [2022-11-20 12:40:53,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:40:53" (1/1) ... [2022-11-20 12:40:53,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:40:53,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:40:53,945 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-20 12:40:53,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:40:53,977 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:40:53,992 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-20 12:40:53,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:40:54,011 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:40:54,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54 WrapperNode [2022-11-20 12:40:54,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:40:54,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:40:54,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:40:54,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:40:54,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,057 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-20 12:40:54,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:40:54,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:40:54,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:40:54,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:40:54,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:40:54,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:40:54,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:40:54,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:40:54,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (1/1) ... [2022-11-20 12:40:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:40:54,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:54,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:40:54,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:40:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:40:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:40:54,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:40:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 12:40:54,337 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:40:54,339 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:40:54,686 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:40:54,693 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:40:54,693 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:40:54,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:54 BoogieIcfgContainer [2022-11-20 12:40:54,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:40:54,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:40:54,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:40:54,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:40:54,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:40:53" (1/3) ... [2022-11-20 12:40:54,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379d90e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:40:54, skipping insertion in model container [2022-11-20 12:40:54,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:54" (2/3) ... [2022-11-20 12:40:54,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379d90e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:40:54, skipping insertion in model container [2022-11-20 12:40:54,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:54" (3/3) ... [2022-11-20 12:40:54,716 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2022-11-20 12:40:54,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:40:54,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:40:54,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:40:54,888 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d568476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:40:54,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:40:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 12:40:54,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:54,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:40:54,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-11-20 12:40:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:40:54,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408621013] [2022-11-20 12:40:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:54,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:40:54,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:40:54,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:40:54,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 12:40:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:55,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:40:55,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:55,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:40:55,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:40:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408621013] [2022-11-20 12:40:55,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408621013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:55,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:55,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042306713] [2022-11-20 12:40:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:55,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:55,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:40:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:55,186 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:55,338 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-11-20 12:40:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-20 12:40:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:55,352 INFO L225 Difference]: With dead ends: 22 [2022-11-20 12:40:55,352 INFO L226 Difference]: Without dead ends: 10 [2022-11-20 12:40:55,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:55,359 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:55,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-20 12:40:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-11-20 12:40:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-20 12:40:55,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-11-20 12:40:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:55,394 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-20 12:40:55,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-20 12:40:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 12:40:55,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:55,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:55,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:55,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:40:55,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-11-20 12:40:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:40:55,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022389113] [2022-11-20 12:40:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:40:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:40:55,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:40:55,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 12:40:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:55,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:40:55,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:55,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:40:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:55,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:40:55,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022389113] [2022-11-20 12:40:55,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022389113] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:40:55,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:40:55,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-20 12:40:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477575917] [2022-11-20 12:40:55,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:40:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:40:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:40:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:40:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:40:55,815 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:56,053 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-20 12:40:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:40:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 8 [2022-11-20 12:40:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:56,058 INFO L225 Difference]: With dead ends: 19 [2022-11-20 12:40:56,058 INFO L226 Difference]: Without dead ends: 15 [2022-11-20 12:40:56,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:40:56,060 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:56,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:40:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-20 12:40:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-20 12:40:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-20 12:40:56,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-20 12:40:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:56,066 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-20 12:40:56,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-20 12:40:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:40:56,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:56,068 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:56,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:40:56,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:40:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-11-20 12:40:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:40:56,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060072334] [2022-11-20 12:40:56,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:40:56,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:40:56,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:40:56,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:40:56,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 12:40:56,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:40:56,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:40:56,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 12:40:56,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:41:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:41:05,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:41:20,676 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:41:58,407 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:42:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-20 12:42:00,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:42:00,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060072334] [2022-11-20 12:42:00,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060072334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:42:00,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:42:00,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-20 12:42:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293968570] [2022-11-20 12:42:00,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:42:00,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 12:42:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:42:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 12:42:00,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=8, NotChecked=46, Total=210 [2022-11-20 12:42:00,311 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:42:05,599 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:42:14,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:42:20,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:42:22,788 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 12:42:24,813 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 12:42:28,099 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse2) .cse2) .cse2) .cse2)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 12:42:43,262 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:42:45,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:42:54,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:42:56,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:42:58,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:43:00,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:43:03,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:43:14,486 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:43:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:43:19,185 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-11-20 12:43:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:43:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:43:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:43:19,187 INFO L225 Difference]: With dead ends: 29 [2022-11-20 12:43:19,187 INFO L226 Difference]: Without dead ends: 21 [2022-11-20 12:43:19,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 104.5s TimeCoverageRelationStatistics Valid=79, Invalid=196, Unknown=17, NotChecked=170, Total=462 [2022-11-20 12:43:19,192 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:43:19,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 6 Unknown, 37 Unchecked, 20.5s Time] [2022-11-20 12:43:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-20 12:43:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-20 12:43:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:43:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-11-20 12:43:19,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-11-20 12:43:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:43:19,201 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-11-20 12:43:19,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:43:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-11-20 12:43:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:43:19,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:43:19,203 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2022-11-20 12:43:19,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:43:19,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:43:19,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:43:19,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:43:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2056177221, now seen corresponding path program 3 times [2022-11-20 12:43:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:43:19,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567368177] [2022-11-20 12:43:19,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:43:19,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:43:19,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:43:19,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:43:19,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 12:43:19,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 12:43:19,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:43:19,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 12:43:19,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:44:09,687 WARN L233 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:44:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:44:46,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:46,766 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:45:55,960 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:45:57,986 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:46:06,620 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:46:08,649 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:47:27,255 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:47:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 8 times theorem prover too weak. 0 trivial. 37 not checked. [2022-11-20 12:47:30,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:47:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567368177] [2022-11-20 12:47:30,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567368177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:47:30,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:47:30,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-20 12:47:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546300521] [2022-11-20 12:47:30,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:47:30,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 12:47:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:47:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 12:47:30,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=180, Unknown=41, NotChecked=132, Total=420 [2022-11-20 12:47:30,347 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 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) [2022-11-20 12:47:32,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:47:35,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:47:37,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:47:38,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:47:40,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:47:45,032 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-20 12:48:13,104 WARN L233 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 24 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:48:15,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:48:18,019 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 12:48:20,058 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 12:48:22,117 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 12:48:24,153 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 12:48:26,199 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 12:48:28,241 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 12:48:30,281 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 12:49:34,410 WARN L233 SmtUtils]: Spent 34.08s on a formula simplification. DAG size of input: 28 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:49:37,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:49:39,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:49:41,749 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|))) is different from false [2022-11-20 12:49:43,780 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|))) is different from true [2022-11-20 12:49:46,231 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:49:48,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:49:50,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:49:52,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:17,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:18,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:20,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:22,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:24,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:27,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:29,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:31,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:33,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:43,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:45,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:47,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:49,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:50:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:50:49,565 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-11-20 12:50:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:50:49,566 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 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) Word has length 20 [2022-11-20 12:50:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:50:49,567 INFO L225 Difference]: With dead ends: 31 [2022-11-20 12:50:49,567 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 12:50:49,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 335.9s TimeCoverageRelationStatistics Valid=108, Invalid=284, Unknown=72, NotChecked=528, Total=992 [2022-11-20 12:50:49,569 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 52.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:50:49,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 16 Unknown, 91 Unchecked, 52.6s Time] [2022-11-20 12:50:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 12:50:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-20 12:50:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-20 12:50:49,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2022-11-20 12:50:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:50:49,578 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-20 12:50:49,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 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) [2022-11-20 12:50:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-20 12:50:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 12:50:49,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:50:49,580 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2022-11-20 12:50:49,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:50:49,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:50:49,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:50:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2127216959, now seen corresponding path program 4 times [2022-11-20 12:50:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:50:49,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057498839] [2022-11-20 12:50:49,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:50:49,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:50:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:50:49,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:50:49,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 12:50:50,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:50:50,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:50:50,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:50:50,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:50:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:50:50,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:50:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:50:51,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:50:51,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057498839] [2022-11-20 12:50:51,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057498839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:50:51,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:50:51,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-11-20 12:50:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495482338] [2022-11-20 12:50:51,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:50:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 12:50:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:50:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 12:50:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-11-20 12:50:51,601 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:50:53,761 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-11-20 12:50:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:50:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 12:50:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:50:53,769 INFO L225 Difference]: With dead ends: 32 [2022-11-20 12:50:53,769 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 12:50:53,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-11-20 12:50:53,771 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:50:53,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 12:50:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 12:50:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-20 12:50:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-20 12:50:53,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-11-20 12:50:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:50:53,785 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-20 12:50:53,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-20 12:50:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:50:53,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:50:53,789 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-11-20 12:50:53,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:50:53,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:50:53,995 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:50:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 5 times [2022-11-20 12:50:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:50:53,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500988787] [2022-11-20 12:50:53,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:50:53,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:50:53,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:50:53,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:50:54,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_663532d8-801b-4ee0-a77f-a947c421a426/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 12:50:54,459 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-20 12:50:54,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:50:54,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:50:54,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:52:26,071 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:52:38,651 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 12:52:53,611 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 12:53:05,908 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:53:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 47 refuted. 2 times theorem prover too weak. 0 trivial. 51 not checked. [2022-11-20 12:53:17,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:54:23,593 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:54:32,786 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:54:42,898 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:54:52,682 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:54:54,718 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:55:05,917 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:55:16,157 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:55:18,205 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:55:27,805 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:55:29,867 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:55:40,193 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:55:42,259 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:55:48,418 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 12:55:50,473 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 12:55:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 94 not checked. [2022-11-20 12:55:50,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:55:50,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500988787] [2022-11-20 12:55:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500988787] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:55:50,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:55:50,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-11-20 12:55:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761783937] [2022-11-20 12:55:50,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:55:50,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 12:55:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:55:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 12:55:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=182, Unknown=28, NotChecked=468, Total=756 [2022-11-20 12:55:50,478 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:55:52,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:55:54,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:55:58,600 WARN L859 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:56:00,659 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 12:56:02,717 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:56:04,772 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 12:56:06,831 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:56:08,889 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 12:56:10,941 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 12:56:13,008 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false