./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- 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 11:37:35,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:37:35,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:37:35,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:37:35,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:37:35,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:37:35,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:37:35,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:37:35,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:37:35,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:37:35,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:37:35,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:37:35,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:37:35,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:37:35,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:37:35,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:37:35,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:37:35,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:37:35,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:37:35,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:37:36,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:37:36,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:37:36,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:37:36,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:37:36,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:37:36,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:37:36,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:37:36,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:37:36,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:37:36,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:37:36,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:37:36,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:37:36,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:37:36,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:37:36,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:37:36,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:37:36,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:37:36,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:37:36,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:37:36,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:37:36,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:37:36,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:37:36,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:37:36,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:37:36,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:37:36,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:37:36,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:37:36,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:37:36,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:37:36,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:37:36,099 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:37:36,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:37:36,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:37:36,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:37:36,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:37:36,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:37:36,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:37:36,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:37:36,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:37:36,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:37:36,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:37:36,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:37:36,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:37:36,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:37:36,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:37:36,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:37:36,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:37:36,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:37:36,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:37:36,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:37:36,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:37:36,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:37:36,106 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:37:36,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:37:36,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:37:36,107 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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-11-20 11:37:36,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:37:36,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:37:36,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:37:36,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:37:36,406 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:37:36,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-20 11:37:39,505 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:37:39,769 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:37:39,770 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-20 11:37:39,775 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data/efe85e76a/1c4df19b7dda47479e90c566f0661136/FLAG5fe7dc7af [2022-11-20 11:37:39,791 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data/efe85e76a/1c4df19b7dda47479e90c566f0661136 [2022-11-20 11:37:39,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:37:39,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:37:39,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:37:39,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:37:39,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:37:39,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:39" (1/1) ... [2022-11-20 11:37:39,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f15cc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:39, skipping insertion in model container [2022-11-20 11:37:39,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:39" (1/1) ... [2022-11-20 11:37:39,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:37:39,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:37:39,981 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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-20 11:37:39,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:37:40,003 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:37:40,019 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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-20 11:37:40,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:37:40,040 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:37:40,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40 WrapperNode [2022-11-20 11:37:40,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:37:40,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:37:40,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:37:40,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:37:40,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,085 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-11-20 11:37:40,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:37:40,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:37:40,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:37:40,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:37:40,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:37:40,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:37:40,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:37:40,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:37:40,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (1/1) ... [2022-11-20 11:37:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:37:40,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:40,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:37:40,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:37:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:37:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:37:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:37:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:37:40,308 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:37:40,310 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:37:40,455 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:37:40,465 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:37:40,465 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:37:40,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:40 BoogieIcfgContainer [2022-11-20 11:37:40,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:37:40,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:37:40,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:37:40,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:37:40,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:37:39" (1/3) ... [2022-11-20 11:37:40,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35090909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:40, skipping insertion in model container [2022-11-20 11:37:40,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:40" (2/3) ... [2022-11-20 11:37:40,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35090909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:40, skipping insertion in model container [2022-11-20 11:37:40,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:40" (3/3) ... [2022-11-20 11:37:40,493 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-11-20 11:37:40,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:37:40,518 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:37:40,607 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:37:40,617 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;@604a3c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:37:40,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:37:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:37:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:37:40,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:40,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:37:40,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-11-20 11:37:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:40,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151456082] [2022-11-20 11:37:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:40,954 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 11:37:40,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:37:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151456082] [2022-11-20 11:37:40,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151456082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:37:40,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:37:40,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:37:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769930285] [2022-11-20 11:37:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:37:40,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:37:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:37:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:37:41,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:37:41,016 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:37:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:41,050 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-11-20 11:37:41,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:37:41,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-20 11:37:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:41,088 INFO L225 Difference]: With dead ends: 16 [2022-11-20 11:37:41,089 INFO L226 Difference]: Without dead ends: 7 [2022-11-20 11:37:41,091 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 11:37:41,095 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:41,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:37:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-20 11:37:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-20 11:37:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 11:37:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-20 11:37:41,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-20 11:37:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:41,213 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-20 11:37:41,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:37:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-20 11:37:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:37:41,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:41,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:37:41,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:37:41,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-11-20 11:37:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:41,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384427816] [2022-11-20 11:37:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:41,319 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 11:37:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:37:41,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384427816] [2022-11-20 11:37:41,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384427816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:37:41,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731660618] [2022-11-20 11:37:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:41,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:41,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:37:41,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:37:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:41,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:37:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:41,499 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 11:37:41,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:41,544 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 11:37:41,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731660618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:41,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:37:41,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-20 11:37:41,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997671282] [2022-11-20 11:37:41,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:41,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:37:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:37:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:37:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:37:41,558 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 11:37:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:41,586 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-11-20 11:37:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:37:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 11:37:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:41,587 INFO L225 Difference]: With dead ends: 13 [2022-11-20 11:37:41,588 INFO L226 Difference]: Without dead ends: 10 [2022-11-20 11:37:41,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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 11:37:41,590 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:41,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:37:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-20 11:37:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-20 11:37:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:37:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-20 11:37:41,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-11-20 11:37:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:41,603 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-20 11:37:41,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 11:37:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-20 11:37:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:37:41,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:41,609 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-20 11:37:41,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:37:41,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-20 11:37:41,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-11-20 11:37:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:41,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000472377] [2022-11-20 11:37:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:37:41,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000472377] [2022-11-20 11:37:41,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000472377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:37:41,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599870432] [2022-11-20 11:37:41,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:37:41,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:41,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:37:42,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:37:42,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:37:42,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:37:42,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:37:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:42,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:42,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599870432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:42,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:37:42,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-20 11:37:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673776763] [2022-11-20 11:37:42,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:42,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:37:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:37:42,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:37:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:37:42,267 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 11:37:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:42,310 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-11-20 11:37:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:37:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 9 [2022-11-20 11:37:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:42,312 INFO L225 Difference]: With dead ends: 19 [2022-11-20 11:37:42,312 INFO L226 Difference]: Without dead ends: 16 [2022-11-20 11:37:42,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 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 11:37:42,314 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:42,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:37:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-20 11:37:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-20 11:37:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:37:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-11-20 11:37:42,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-11-20 11:37:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:42,321 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-11-20 11:37:42,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 11:37:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-11-20 11:37:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:37:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:42,323 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-20 11:37:42,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 11:37:42,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:37:42,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-11-20 11:37:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:37:42,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661221945] [2022-11-20 11:37:42,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:37:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:37:42,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:37:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:37:42,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:37:42,612 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:37:42,614 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:37:42,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:37:42,619 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-20 11:37:42,623 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:37:42,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:37:42 BoogieIcfgContainer [2022-11-20 11:37:42,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:37:42,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:37:42,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:37:42,648 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:37:42,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:40" (3/4) ... [2022-11-20 11:37:42,653 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:37:42,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:37:42,654 INFO L158 Benchmark]: Toolchain (without parser) took 2857.11ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 109.9MB in the beginning and 128.0MB in the end (delta: -18.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-11-20 11:37:42,654 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 140.5MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:37:42,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.13ms. Allocated memory is still 140.5MB. Free memory was 109.5MB in the beginning and 99.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 11:37:42,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 140.5MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:37:42,655 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 140.5MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:37:42,656 INFO L158 Benchmark]: RCFGBuilder took 346.59ms. Allocated memory is still 140.5MB. Free memory was 97.0MB in the beginning and 88.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 11:37:42,656 INFO L158 Benchmark]: TraceAbstraction took 2174.92ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 87.6MB in the beginning and 128.0MB in the end (delta: -40.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-11-20 11:37:42,657 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 195.0MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:37:42,659 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.32ms. Allocated memory is still 140.5MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.13ms. Allocated memory is still 140.5MB. Free memory was 109.5MB in the beginning and 99.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 140.5MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 140.5MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.59ms. Allocated memory is still 140.5MB. Free memory was 97.0MB in the beginning and 88.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2174.92ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 87.6MB in the beginning and 128.0MB in the end (delta: -40.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 195.0MB. Free memory is still 128.0MB. 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: 29]: 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 24, overapproximation of someBinaryArithmeticFLOAToperation at line 16. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__tick = 0.10000000149011612; [L10] float main__time = 0.0; [L11] int main__i; [L12] main__i = 0 VAL [__return_main=0, main__i=0, main__tick=2500000037252903/25000000000000000, main__time=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L14] COND FALSE !(main__i < 10) [L23] int __tmp_1; [L24] __tmp_1 = main__time != 1.0 [L25] int __VERIFIER_assert__cond; [L26] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L27] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L29] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 18 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 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 11:37:42,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- 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 11:37:45,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:37:45,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:37:45,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:37:45,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:37:45,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:37:45,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:37:45,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:37:45,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:37:45,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:37:45,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:37:45,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:37:45,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:37:45,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:37:45,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:37:45,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:37:45,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:37:45,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:37:45,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:37:45,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:37:45,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:37:45,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:37:45,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:37:45,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:37:45,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:37:45,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:37:45,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:37:45,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:37:45,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:37:45,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:37:45,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:37:45,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:37:45,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:37:45,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:37:45,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:37:45,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:37:45,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:37:45,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:37:45,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:37:45,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:37:45,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:37:45,449 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 11:37:45,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:37:45,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:37:45,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:37:45,498 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:37:45,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:37:45,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:37:45,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:37:45,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:37:45,503 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:37:45,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:37:45,504 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:37:45,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:37:45,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:37:45,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:37:45,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:37:45,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:37:45,506 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:37:45,506 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:37:45,506 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:37:45,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:37:45,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:37:45,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:37:45,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:37:45,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:37:45,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:37:45,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:37:45,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:37:45,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:37:45,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:37:45,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:37:45,509 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:37:45,509 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:37:45,510 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:37:45,510 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:37:45,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:37:45,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:37:45,511 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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-11-20 11:37:45,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:37:45,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:37:45,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:37:45,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:37:45,969 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:37:45,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-20 11:37:49,183 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:37:49,441 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:37:49,441 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-20 11:37:49,449 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data/5c663a8fe/e3ffef7becdb41328c139e93b7ddbbdc/FLAGd8a1bdea2 [2022-11-20 11:37:49,476 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/data/5c663a8fe/e3ffef7becdb41328c139e93b7ddbbdc [2022-11-20 11:37:49,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:37:49,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:37:49,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:37:49,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:37:49,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:37:49,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfc47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49, skipping insertion in model container [2022-11-20 11:37:49,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:37:49,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:37:49,748 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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-20 11:37:49,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:37:49,778 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:37:49,800 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_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-20 11:37:49,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:37:49,819 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:37:49,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49 WrapperNode [2022-11-20 11:37:49,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:37:49,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:37:49,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:37:49,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:37:49,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,861 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2022-11-20 11:37:49,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:37:49,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:37:49,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:37:49,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:37:49,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:37:49,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:37:49,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:37:49,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:37:49,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (1/1) ... [2022-11-20 11:37:49,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:37:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:37:49,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:37:49,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:37:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:37:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:37:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:37:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:37:50,114 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:37:50,116 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:37:50,396 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:37:50,402 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:37:50,403 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:37:50,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:50 BoogieIcfgContainer [2022-11-20 11:37:50,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:37:50,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:37:50,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:37:50,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:37:50,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:37:49" (1/3) ... [2022-11-20 11:37:50,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251f639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:50, skipping insertion in model container [2022-11-20 11:37:50,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:49" (2/3) ... [2022-11-20 11:37:50,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251f639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:50, skipping insertion in model container [2022-11-20 11:37:50,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:50" (3/3) ... [2022-11-20 11:37:50,415 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-11-20 11:37:50,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:37:50,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:37:50,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:37:50,500 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;@78ee2f7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:37:50,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:37:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:37:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:37:50,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:50,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:37:50,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-11-20 11:37:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:37:50,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173892026] [2022-11-20 11:37:50,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:50,588 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 11:37:50,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:37:50,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:50,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:50,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 11:37:50,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:50,943 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 11:37:50,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:37:50,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:37:50,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173892026] [2022-11-20 11:37:50,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173892026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:37:50,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:37:50,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:37:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074565876] [2022-11-20 11:37:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:37:50,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:37:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:37:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:37:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:37:51,026 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:37:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:51,226 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-11-20 11:37:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:37:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-20 11:37:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:51,242 INFO L225 Difference]: With dead ends: 16 [2022-11-20 11:37:51,242 INFO L226 Difference]: Without dead ends: 7 [2022-11-20 11:37:51,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:37:51,254 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:51,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:37:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-20 11:37:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-20 11:37:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 11:37:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-20 11:37:51,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-20 11:37:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:51,296 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-20 11:37:51,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:37:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-20 11:37:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:37:51,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:51,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:37:51,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:51,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:51,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-11-20 11:37:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:37:51,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138583570] [2022-11-20 11:37:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:37:51,515 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 11:37:51,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:37:51,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:51,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:37:51,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:37:51,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:51,712 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 11:37:51,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:51,769 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 11:37:51,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:37:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138583570] [2022-11-20 11:37:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138583570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:51,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:37:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-20 11:37:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335651657] [2022-11-20 11:37:51,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:37:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:37:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:37:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:37:51,774 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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 11:37:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:52,134 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-11-20 11:37:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:37:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) Word has length 6 [2022-11-20 11:37:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:52,140 INFO L225 Difference]: With dead ends: 13 [2022-11-20 11:37:52,140 INFO L226 Difference]: Without dead ends: 10 [2022-11-20 11:37:52,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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 11:37:52,142 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:52,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:37:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-20 11:37:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-20 11:37:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:37:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-20 11:37:52,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-11-20 11:37:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:52,149 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-20 11:37:52,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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 11:37:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-20 11:37:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:37:52,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:52,151 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-20 11:37:52,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:52,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:52,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-11-20 11:37:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:37:52,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328132894] [2022-11-20 11:37:52,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:37:52,373 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 11:37:52,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:37:52,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:52,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:52,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:37:52,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:37:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:37:52,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:37:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:52,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:37:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:37:52,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:37:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328132894] [2022-11-20 11:37:52,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328132894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:37:52,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:37:52,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-20 11:37:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567842117] [2022-11-20 11:37:52,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:37:52,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:37:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:37:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:37:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:37:52,825 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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 11:37:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:37:53,739 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-11-20 11:37:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:37:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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 9 [2022-11-20 11:37:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:37:53,744 INFO L225 Difference]: With dead ends: 19 [2022-11-20 11:37:53,745 INFO L226 Difference]: Without dead ends: 16 [2022-11-20 11:37:53,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:37:53,747 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:37:53,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:37:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-20 11:37:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-20 11:37:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:37:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-11-20 11:37:53,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-11-20 11:37:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:37:53,756 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-11-20 11:37:53,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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 11:37:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-11-20 11:37:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:37:53,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:37:53,757 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-20 11:37:53,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:53,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:53,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:37:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:37:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-11-20 11:37:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:37:53,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424824304] [2022-11-20 11:37:53,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:37:53,978 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 11:37:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:37:53,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:53,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:37:54,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 11:37:54,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:37:54,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:37:54,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:40,098 WARN L233 SmtUtils]: Spent 6.99s 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 11:39:48,396 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:40:37,283 WARN L233 SmtUtils]: Spent 6.12s 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 11:40:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 31 refuted. 14 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-20 11:40:40,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:44,171 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:41:51,391 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:41:56,047 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 11:41:58,081 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:43:19,813 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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 11:43:21,858 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:43:27,793 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 11:43:29,843 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:43:36,020 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 11:43:38,080 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:43:44,288 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-20 11:43:46,352 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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-20 11:43:52,530 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .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 11:43:54,587 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .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 11:43:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 5 times theorem prover too weak. 0 trivial. 49 not checked. [2022-11-20 11:43:54,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:43:54,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424824304] [2022-11-20 11:43:54,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424824304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:43:54,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:43:54,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-11-20 11:43:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165798785] [2022-11-20 11:43:54,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:43:54,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:43:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:43:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:43:54,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=208, Unknown=86, NotChecked=378, Total=756 [2022-11-20 11:43:54,592 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:43:57,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:43:59,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:44:01,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:44:03,822 WARN L859 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .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 11:44:05,884 WARN L837 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= 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 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-11-20 11:44:07,956 WARN L859 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= 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 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-20 11:44:10,022 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:44:12,088 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 11:44:14,163 WARN L837 $PredicateComparison]: unable to prove that (and (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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:44:16,217 WARN L859 $PredicateComparison]: unable to prove that (and (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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 11:44:18,283 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:44:23,649 WARN L859 $PredicateComparison]: unable to prove that (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 11:44:25,718 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:44:27,761 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 11:44:29,827 WARN L837 $PredicateComparison]: unable to prove that (and (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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:44:33,805 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 11:44:35,837 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 11:44:38,433 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 11:44:40,577 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~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_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (= (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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)))) is different from false [2022-11-20 11:44:42,619 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~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_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (= (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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)))) is different from true [2022-11-20 11:44:45,062 WARN L859 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 11:44:46,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 11:44:48,830 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 11:44:50,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 11:44:52,055 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 11:44:54,076 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 11:45:04,676 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 11:45:07,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 11:45:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:07,534 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-11-20 11:45:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:45:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 11:45:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:07,536 INFO L225 Difference]: With dead ends: 22 [2022-11-20 11:45:07,536 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 11:45:07,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 347.9s TimeCoverageRelationStatistics Valid=111, Invalid=244, Unknown=105, NotChecked=1100, Total=1560 [2022-11-20 11:45:07,539 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:07,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 7 Unknown, 64 Unchecked, 23.6s Time] [2022-11-20 11:45:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 11:45:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 11:45:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-20 11:45:07,548 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-11-20 11:45:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:07,549 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-20 11:45:07,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-20 11:45:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:45:07,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:07,550 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2022-11-20 11:45:07,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:45:07,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:45:07,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:45:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash 456734918, now seen corresponding path program 4 times [2022-11-20 11:45:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:07,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143520319] [2022-11-20 11:45:07,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:45:07,752 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 11:45:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:07,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:45:07,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:45:08,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:45:08,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:45:08,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:45:08,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:45:08,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:45:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:45:10,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:45:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143520319] [2022-11-20 11:45:10,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143520319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:45:10,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:45:10,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-20 11:45:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799838225] [2022-11-20 11:45:10,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:45:10,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 11:45:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:45:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 11:45:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:45:10,515 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:12,082 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-11-20 11:45:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:45:12,088 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 11:45:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:12,089 INFO L225 Difference]: With dead ends: 18 [2022-11-20 11:45:12,089 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:45:12,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:45:12,091 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:12,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 11:45:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:45:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:45:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 11:45:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:45:12,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-11-20 11:45:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:12,093 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:45:12,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:45:12,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:45:12,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:45:12,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:45:12,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a48e5de-dd2b-4c9a-80ab-35729bb6f1a6/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 11:45:12,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.