./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:49:27,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:49:27,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:49:27,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:49:27,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:49:27,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:49:27,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:49:27,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:49:27,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:49:27,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:49:27,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:49:27,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:49:27,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:49:27,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:49:27,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:49:27,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:49:27,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:49:27,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:49:27,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:49:27,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:49:27,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:49:27,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:49:27,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:49:27,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:49:27,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:49:27,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:49:27,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:49:27,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:49:27,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:49:27,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:49:27,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:49:27,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:49:27,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:49:27,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:49:27,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:49:27,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:49:27,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:49:27,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:49:27,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:49:27,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:49:27,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:49:27,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:49:27,368 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:49:27,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:49:27,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:49:27,370 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:49:27,370 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:49:27,370 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:49:27,370 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:49:27,371 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:49:27,371 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:49:27,371 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:49:27,371 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:49:27,371 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:49:27,372 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:49:27,372 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:49:27,372 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:49:27,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:49:27,377 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:49:27,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:49:27,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:49:27,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:49:27,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:49:27,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:49:27,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:49:27,379 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:49:27,379 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:49:27,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:49:27,379 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:49:27,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:49:27,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:49:27,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:49:27,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:49:27,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:49:27,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:49:27,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:49:27,384 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:49:27,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:49:27,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:49:27,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:49:27,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:49:27,386 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/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_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2021-11-07 01:49:27,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:49:27,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:49:27,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:49:27,760 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:49:27,761 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:49:27,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-07 01:49:27,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/0bce19158/8397fc3287fa443899ccf31eb9006890/FLAGf68f9ea5e [2021-11-07 01:49:28,475 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:49:28,475 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-07 01:49:28,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/0bce19158/8397fc3287fa443899ccf31eb9006890/FLAGf68f9ea5e [2021-11-07 01:49:28,838 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/0bce19158/8397fc3287fa443899ccf31eb9006890 [2021-11-07 01:49:28,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:49:28,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:49:28,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:49:28,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:49:28,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:49:28,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:28" (1/1) ... [2021-11-07 01:49:28,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602a0825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:28, skipping insertion in model container [2021-11-07 01:49:28,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:28" (1/1) ... [2021-11-07 01:49:28,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:49:28,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:49:29,125 WARN L228 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_e5a1cf37-d5db-4f74-879f-84496b03bd62/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-07 01:49:29,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:49:29,143 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:49:29,168 WARN L228 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_e5a1cf37-d5db-4f74-879f-84496b03bd62/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-07 01:49:29,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:49:29,191 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:49:29,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29 WrapperNode [2021-11-07 01:49:29,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:49:29,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:49:29,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:49:29,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:49:29,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:49:29,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:49:29,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:49:29,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:49:29,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:49:29,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:49:29,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:49:29,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:49:29,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (1/1) ... [2021-11-07 01:49:29,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:49:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:49:29,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:49:29,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:49:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:49:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:49:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-07 01:49:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:49:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:49:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-07 01:49:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:49:29,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:49:29,758 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:49:29,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:29 BoogieIcfgContainer [2021-11-07 01:49:29,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:49:29,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:49:29,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:49:29,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:49:29,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:49:28" (1/3) ... [2021-11-07 01:49:29,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6a7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:29, skipping insertion in model container [2021-11-07 01:49:29,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:29" (2/3) ... [2021-11-07 01:49:29,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6a7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:29, skipping insertion in model container [2021-11-07 01:49:29,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:29" (3/3) ... [2021-11-07 01:49:29,791 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-11-07 01:49:29,797 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:49:29,798 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:49:29,858 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:49:29,866 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:49:29,866 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:49:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:49:29,891 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:29,892 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:29,893 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:49:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2021-11-07 01:49:29,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:29,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396506533] [2021-11-07 01:49:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:29,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:30,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:30,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396506533] [2021-11-07 01:49:30,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396506533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:30,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:30,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:49:30,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287386916] [2021-11-07 01:49:30,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:49:30,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:49:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:49:30,308 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2021-11-07 01:49:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:30,441 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-11-07 01:49:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:49:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 11 [2021-11-07 01:49:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:30,454 INFO L225 Difference]: With dead ends: 44 [2021-11-07 01:49:30,455 INFO L226 Difference]: Without dead ends: 26 [2021-11-07 01:49:30,460 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:49:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-07 01:49:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2021-11-07 01:49:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-11-07 01:49:30,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2021-11-07 01:49:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:30,499 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-11-07 01:49:30,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2021-11-07 01:49:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-11-07 01:49:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:49:30,500 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:30,501 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:30,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:49:30,502 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:49:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2021-11-07 01:49:30,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:30,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129658553] [2021-11-07 01:49:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:30,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:30,609 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:30,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129658553] [2021-11-07 01:49:30,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129658553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:30,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:30,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:49:30,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621841462] [2021-11-07 01:49:30,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:49:30,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:49:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:30,615 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-11-07 01:49:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:30,639 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-11-07 01:49:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:49:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2021-11-07 01:49:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:30,641 INFO L225 Difference]: With dead ends: 33 [2021-11-07 01:49:30,641 INFO L226 Difference]: Without dead ends: 25 [2021-11-07 01:49:30,642 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-07 01:49:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-07 01:49:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-11-07 01:49:30,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2021-11-07 01:49:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:30,648 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-11-07 01:49:30,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-11-07 01:49:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2021-11-07 01:49:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:49:30,649 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:30,649 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:30,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:49:30,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:49:30,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2021-11-07 01:49:30,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:30,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479305777] [2021-11-07 01:49:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:30,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:49:30,675 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:49:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:49:30,739 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:49:30,740 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:49:30,741 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:49:30,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:49:30,748 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-07 01:49:30,751 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:49:30,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:49:30 BoogieIcfgContainer [2021-11-07 01:49:30,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:49:30,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:49:30,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:49:30,817 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:49:30,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:29" (3/4) ... [2021-11-07 01:49:30,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:49:30,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:49:30,826 INFO L168 Benchmark]: Toolchain (without parser) took 1968.86 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 52.2 MB in the beginning and 81.9 MB in the end (delta: -29.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:49:30,826 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 90.2 MB. Free memory is still 68.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:49:30,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.48 ms. Allocated memory is still 90.2 MB. Free memory was 52.0 MB in the beginning and 65.6 MB in the end (delta: -13.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:49:30,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.77 ms. Allocated memory is still 90.2 MB. Free memory was 65.6 MB in the beginning and 63.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:49:30,837 INFO L168 Benchmark]: Boogie Preprocessor took 33.98 ms. Allocated memory is still 90.2 MB. Free memory was 63.9 MB in the beginning and 62.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:49:30,838 INFO L168 Benchmark]: RCFGBuilder took 464.93 ms. Allocated memory is still 90.2 MB. Free memory was 62.5 MB in the beginning and 50.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:49:30,839 INFO L168 Benchmark]: TraceAbstraction took 1052.49 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 50.2 MB in the beginning and 81.9 MB in the end (delta: -31.7 MB). Peak memory consumption was 399.4 kB. Max. memory is 16.1 GB. [2021-11-07 01:49:30,840 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 119.5 MB. Free memory is still 81.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:49:30,849 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.33 ms. Allocated memory is still 90.2 MB. Free memory is still 68.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 336.48 ms. Allocated memory is still 90.2 MB. Free memory was 52.0 MB in the beginning and 65.6 MB in the end (delta: -13.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.77 ms. Allocated memory is still 90.2 MB. Free memory was 65.6 MB in the beginning and 63.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.98 ms. Allocated memory is still 90.2 MB. Free memory was 63.9 MB in the beginning and 62.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 464.93 ms. Allocated memory is still 90.2 MB. Free memory was 62.5 MB in the beginning and 50.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1052.49 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 50.2 MB in the beginning and 81.9 MB in the end (delta: -31.7 MB). Peak memory consumption was 399.4 kB. Max. memory is 16.1 GB. * Witness Printer took 5.16 ms. Allocated memory is still 119.5 MB. Free memory is still 81.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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: 51]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L51] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 41 SDslu, 67 SDs, 0 SdLazy, 24 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 01:49:30,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:49:33,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:49:33,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:49:33,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:49:33,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:49:33,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:49:33,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:49:33,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:49:33,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:49:33,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:49:33,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:49:33,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:49:33,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:49:33,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:49:33,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:49:33,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:49:33,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:49:33,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:49:33,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:49:33,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:49:33,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:49:33,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:49:33,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:49:33,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:49:33,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:49:33,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:49:33,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:49:33,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:49:33,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:49:33,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:49:33,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:49:33,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:49:33,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:49:33,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:49:33,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:49:33,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:49:33,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:49:33,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:49:33,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:49:33,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:49:33,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:49:33,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 01:49:33,838 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:49:33,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:49:33,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:49:33,841 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:49:33,841 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:49:33,841 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:49:33,842 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:49:33,842 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:49:33,842 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:49:33,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:49:33,845 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:49:33,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:49:33,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:49:33,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:49:33,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:49:33,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:49:33,847 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:49:33,847 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 01:49:33,847 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 01:49:33,848 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:49:33,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:49:33,848 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:49:33,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:49:33,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:49:33,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 01:49:33,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:49:33,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:49:33,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:49:33,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:49:33,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:49:33,851 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 01:49:33,851 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 01:49:33,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:49:33,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:49:33,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:49:33,852 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_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/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_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2021-11-07 01:49:34,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:49:34,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:49:34,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:49:34,361 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:49:34,362 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:49:34,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-07 01:49:34,458 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/1989eb29f/36507f660781478baf7fe3dbab699693/FLAG32bc26efe [2021-11-07 01:49:35,053 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:49:35,054 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-11-07 01:49:35,064 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/1989eb29f/36507f660781478baf7fe3dbab699693/FLAG32bc26efe [2021-11-07 01:49:35,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/data/1989eb29f/36507f660781478baf7fe3dbab699693 [2021-11-07 01:49:35,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:49:35,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:49:35,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:49:35,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:49:35,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:49:35,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68563f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35, skipping insertion in model container [2021-11-07 01:49:35,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:49:35,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:49:35,623 WARN L228 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_e5a1cf37-d5db-4f74-879f-84496b03bd62/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-07 01:49:35,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:49:35,681 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:49:35,745 WARN L228 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_e5a1cf37-d5db-4f74-879f-84496b03bd62/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-11-07 01:49:35,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:49:35,780 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:49:35,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35 WrapperNode [2021-11-07 01:49:35,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:49:35,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:49:35,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:49:35,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:49:35,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:49:35,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:49:35,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:49:35,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:49:35,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:49:35,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:49:35,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:49:35,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:49:35,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (1/1) ... [2021-11-07 01:49:35,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:49:35,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:49:35,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:49:35,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:49:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-07 01:49:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 01:49:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:49:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-07 01:49:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:49:36,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:49:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:49:37,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:49:37,449 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:49:37,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:37 BoogieIcfgContainer [2021-11-07 01:49:37,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:49:37,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:49:37,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:49:37,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:49:37,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:49:35" (1/3) ... [2021-11-07 01:49:37,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdb06f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:37, skipping insertion in model container [2021-11-07 01:49:37,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:35" (2/3) ... [2021-11-07 01:49:37,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdb06f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:37, skipping insertion in model container [2021-11-07 01:49:37,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:37" (3/3) ... [2021-11-07 01:49:37,461 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-11-07 01:49:37,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:49:37,467 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:49:37,517 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:49:37,525 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:49:37,525 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:49:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:49:37,544 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:37,545 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:37,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:49:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-11-07 01:49:37,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:49:37,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51314881] [2021-11-07 01:49:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:37,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:49:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:49:37,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:49:37,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 01:49:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:37,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:49:38,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:49:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:38,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:49:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:38,201 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:49:38,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51314881] [2021-11-07 01:49:38,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51314881] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:38,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:38,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 01:49:38,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163632802] [2021-11-07 01:49:38,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:49:38,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:49:38,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:49:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:49:38,231 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:46,174 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2021-11-07 01:49:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:49:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 01:49:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:46,221 INFO L225 Difference]: With dead ends: 55 [2021-11-07 01:49:46,222 INFO L226 Difference]: Without dead ends: 35 [2021-11-07 01:49:46,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:49:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-07 01:49:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2021-11-07 01:49:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-11-07 01:49:46,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2021-11-07 01:49:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:46,254 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-07 01:49:46,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-11-07 01:49:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:49:46,256 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:46,256 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:46,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:49:46,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:49:46,457 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:49:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2021-11-07 01:49:46,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:49:46,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199107612] [2021-11-07 01:49:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:46,461 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:49:46,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:49:46,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:49:46,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 01:49:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:46,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:49:46,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:49:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:46,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:49:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:47,038 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:49:47,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199107612] [2021-11-07 01:49:47,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199107612] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:47,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:47,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 01:49:47,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958658975] [2021-11-07 01:49:47,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:49:47,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:49:47,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:49:47,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:49:47,052 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-11-07 01:49:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:49,772 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-07 01:49:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:49:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Word has length 13 [2021-11-07 01:49:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:49,774 INFO L225 Difference]: With dead ends: 23 [2021-11-07 01:49:49,774 INFO L226 Difference]: Without dead ends: 19 [2021-11-07 01:49:49,775 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:49:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-07 01:49:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-07 01:49:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:49:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-07 01:49:49,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2021-11-07 01:49:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:49,782 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-07 01:49:49,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-11-07 01:49:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-07 01:49:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:49:49,783 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:49,784 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:49,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:49:50,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:49:50,005 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:49:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-11-07 01:49:50,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:49:50,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693490843] [2021-11-07 01:49:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:50,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:49:50,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:49:50,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:49:50,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:49:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:50,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 01:49:50,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:49:52,991 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 01:49:52,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2021-11-07 01:50:20,020 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= c_ULTIMATE.start_main_~main__z~0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0))))) is different from false [2021-11-07 01:51:15,546 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))))) is different from false [2021-11-07 01:51:17,570 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))))) is different from true [2021-11-07 01:54:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:54:03,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:54:10,477 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2021-11-07 01:54:12,526 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2021-11-07 01:54:21,703 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) is different from false [2021-11-07 01:54:23,755 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) is different from true [2021-11-07 01:54:34,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2021-11-07 01:54:36,137 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2021-11-07 01:54:46,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from false [2021-11-07 01:54:48,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from true [2021-11-07 01:55:01,150 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from false [2021-11-07 01:55:03,204 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)))) is different from true [2021-11-07 01:55:20,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from false [2021-11-07 01:55:22,575 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from true [2021-11-07 01:55:36,773 WARN L207 SmtUtils]: Spent 14.15 s on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2021-11-07 01:55:36,774 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:55:36,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 102 [2021-11-07 01:56:54,173 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1))))) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-07 01:56:56,226 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1))))) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-07 01:56:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:56:56,226 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:56:56,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693490843] [2021-11-07 01:56:56,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693490843] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:56:56,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:56:56,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-07 01:56:56,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453868662] [2021-11-07 01:56:56,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 01:56:56,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:56:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 01:56:56,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-07 01:56:56,231 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:56:58,533 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1))))) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:57:00,603 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1))))) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:57:02,632 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse8 |c_ULTIMATE.start_main_#t~mem8|))) is different from false [2021-11-07 01:57:04,684 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse9 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse8 |c_ULTIMATE.start_main_#t~mem8|))) is different from true [2021-11-07 01:57:08,238 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse6 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (.cse2 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse0 |c_ULTIMATE.start_main_#t~mem9|) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 01:57:11,542 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse6 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (.cse2 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2)))))) is different from true [2021-11-07 01:57:15,118 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse0 (let ((.cse11 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse8 (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (let ((.cse5 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ +zero 11 53))))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse8) (= (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 01:57:19,200 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse11 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse9 (select .cse5 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= |c_ULTIMATE.start_main_#t~mem10| .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse2) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 01:57:23,100 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse10 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse7 (let ((.cse9 (select .cse5 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (_ +zero 11 53)) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse7) (= (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 01:57:25,185 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__z~0) (_ +zero 11 53)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= c_ULTIMATE.start_main_~main__z~0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0))))) is different from false [2021-11-07 01:57:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:36,828 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-11-07 01:57:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:57:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:57:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:36,834 INFO L225 Difference]: With dead ends: 35 [2021-11-07 01:57:36,834 INFO L226 Difference]: Without dead ends: 30 [2021-11-07 01:57:36,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=62, Invalid=69, Unknown=27, NotChecked=544, Total=702 [2021-11-07 01:57:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-07 01:57:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-11-07 01:57:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:57:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2021-11-07 01:57:36,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2021-11-07 01:57:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:36,844 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-11-07 01:57:36,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:57:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2021-11-07 01:57:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:57:36,846 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:36,846 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:36,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:57:37,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:57:37,050 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2021-11-07 01:57:37,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:57:37,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142562639] [2021-11-07 01:57:37,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:37,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:57:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:57:37,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:57:37,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 01:57:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:37,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:57:37,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:57:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:37,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:57:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:37,612 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:57:37,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142562639] [2021-11-07 01:57:37,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142562639] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:37,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:37,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 01:57:37,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325587011] [2021-11-07 01:57:37,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:57:37,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:57:37,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:57:37,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:37,616 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:57:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:37,656 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-11-07 01:57:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:57:37,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:57:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:37,658 INFO L225 Difference]: With dead ends: 35 [2021-11-07 01:57:37,658 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 01:57:37,659 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 01:57:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-07 01:57:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:57:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-07 01:57:37,664 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-07 01:57:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:37,664 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-07 01:57:37,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:57:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-07 01:57:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:57:37,666 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:37,666 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:37,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:57:37,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:57:37,881 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2021-11-07 01:57:37,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:57:37,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734639181] [2021-11-07 01:57:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:37,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:57:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:57:37,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:57:37,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a1cf37-d5db-4f74-879f-84496b03bd62/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 01:57:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:39,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 01:57:39,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:57:41,776 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 01:57:41,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2021-11-07 01:58:03,356 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~main__z~0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)))) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:58:42,392 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~main__z~0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)))) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__z~0) (_ +zero 11 53))) is different from false [2021-11-07 01:59:56,234 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0))))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))))))) is different from false [2021-11-07 01:59:58,269 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0))))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))))))) is different from true [2021-11-07 02:03:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:37,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:03:52,277 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1))))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-07 02:03:54,328 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1))))))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true