./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:52:57,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:52:57,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:52:57,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:52:57,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:52:57,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:52:57,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:52:57,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:52:57,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:52:57,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:52:57,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:52:57,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:52:57,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:52:57,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:52:57,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:52:57,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:52:57,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:52:57,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:52:57,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:52:57,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:52:57,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:52:57,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:52:57,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:52:57,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:52:57,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:52:57,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:52:57,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:52:57,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:52:57,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:52:57,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:52:57,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:52:57,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:52:57,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:52:57,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:52:57,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:52:57,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:52:57,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:52:57,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:52:57,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:52:57,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:52:57,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:52:57,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 03:52:57,188 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:52:57,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:52:57,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:52:57,193 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:52:57,193 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:52:57,193 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:52:57,193 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 03:52:57,194 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:52:57,194 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:52:57,194 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 03:52:57,195 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 03:52:57,195 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:52:57,195 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 03:52:57,196 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 03:52:57,196 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 03:52:57,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:52:57,197 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:52:57,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:52:57,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:52:57,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:52:57,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 03:52:57,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:52:57,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 03:52:57,199 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:52:57,199 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:52:57,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 03:52:57,199 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:52:57,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 03:52:57,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:52:57,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:52:57,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:52:57,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:52:57,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:52:57,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 03:52:57,203 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 03:52:57,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:52:57,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 03:52:57,203 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:52:57,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:52:57,204 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_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/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_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2021-11-03 03:52:57,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:52:57,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:52:57,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:52:57,476 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:52:57,476 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:52:57,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-03 03:52:57,545 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/b3eb5aa03/2f8feb2a9155426abd19b6e2ed7c369b/FLAG32b9ee8c1 [2021-11-03 03:52:58,116 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:52:58,117 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-03 03:52:58,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/b3eb5aa03/2f8feb2a9155426abd19b6e2ed7c369b/FLAG32b9ee8c1 [2021-11-03 03:52:58,473 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/b3eb5aa03/2f8feb2a9155426abd19b6e2ed7c369b [2021-11-03 03:52:58,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:52:58,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:52:58,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:52:58,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:52:58,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:52:58,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f160e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58, skipping insertion in model container [2021-11-03 03:52:58,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:52:58,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:52:58,705 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_20a74b39-9bed-44a1-a138-7ab2d9811a01/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-03 03:52:58,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:52:58,718 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:52:58,738 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_20a74b39-9bed-44a1-a138-7ab2d9811a01/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-03 03:52:58,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:52:58,754 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:52:58,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58 WrapperNode [2021-11-03 03:52:58,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:52:58,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:52:58,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:52:58,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:52:58,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:52:58,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:52:58,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:52:58,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:52:58,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:52:58,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:52:58,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:52:58,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:52:58,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (1/1) ... [2021-11-03 03:52:58,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:52:58,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:52:58,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:52:58,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:52:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 03:52:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:52:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-03 03:52:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:52:58,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:52:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-03 03:52:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:52:59,337 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:52:59,338 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 03:52:59,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:52:59 BoogieIcfgContainer [2021-11-03 03:52:59,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:52:59,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:52:59,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:52:59,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:52:59,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:52:58" (1/3) ... [2021-11-03 03:52:59,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc21a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:52:59, skipping insertion in model container [2021-11-03 03:52:59,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:52:58" (2/3) ... [2021-11-03 03:52:59,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc21a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:52:59, skipping insertion in model container [2021-11-03 03:52:59,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:52:59" (3/3) ... [2021-11-03 03:52:59,350 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2021-11-03 03:52:59,357 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:52:59,357 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 03:52:59,415 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:52:59,424 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-03 03:52:59,424 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 03:52:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 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-03 03:52:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 03:52:59,445 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:59,446 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:59,447 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 03:52:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:59,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1392335393, now seen corresponding path program 1 times [2021-11-03 03:52:59,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:52:59,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512838620] [2021-11-03 03:52:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:59,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:52:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:59,725 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-03 03:52:59,726 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:52:59,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512838620] [2021-11-03 03:52:59,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512838620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:59,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:59,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 03:52:59,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752895515] [2021-11-03 03:52:59,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:52:59,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:52:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:52:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:52:59,769 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 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) 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-03 03:52:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:59,849 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2021-11-03 03:52:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:52:59,850 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-03 03:52:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:59,858 INFO L225 Difference]: With dead ends: 26 [2021-11-03 03:52:59,858 INFO L226 Difference]: Without dead ends: 14 [2021-11-03 03:52:59,860 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:52:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-03 03:52:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-03 03:52:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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-03 03:52:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-03 03:52:59,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2021-11-03 03:52:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:59,890 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-03 03:52:59,891 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-03 03:52:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-03 03:52:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 03:52:59,892 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:59,892 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:59,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 03:52:59,893 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 03:52:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1409346054, now seen corresponding path program 1 times [2021-11-03 03:52:59,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:52:59,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051879417] [2021-11-03 03:52:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:59,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:52:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:52:59,938 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-03 03:52:59,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:52:59,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051879417] [2021-11-03 03:52:59,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051879417] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:52:59,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:52:59,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:52:59,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476948042] [2021-11-03 03:52:59,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:52:59,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:52:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:52:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:52:59,942 INFO L87 Difference]: Start difference. First operand 14 states and 16 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-03 03:52:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:52:59,957 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-11-03 03:52:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:52:59,957 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-03 03:52:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:52:59,958 INFO L225 Difference]: With dead ends: 32 [2021-11-03 03:52:59,959 INFO L226 Difference]: Without dead ends: 24 [2021-11-03 03:52:59,959 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-03 03:52:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-03 03:52:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2021-11-03 03:52:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:52:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-03 03:52:59,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-11-03 03:52:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:52:59,965 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-03 03:52:59,965 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-03 03:52:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-11-03 03:52:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:52:59,966 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:52:59,966 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:52:59,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 03:52:59,967 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 03:52:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:52:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1916271840, now seen corresponding path program 1 times [2021-11-03 03:52:59,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:52:59,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759578918] [2021-11-03 03:52:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:52:59,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:52:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:52:59,987 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 03:53:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:53:00,026 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 03:53:00,029 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 03:53:00,030 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 03:53:00,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 03:53:00,036 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-03 03:53:00,038 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 03:53:00,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:53:00 BoogieIcfgContainer [2021-11-03 03:53:00,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 03:53:00,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 03:53:00,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 03:53:00,095 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 03:53:00,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:52:59" (3/4) ... [2021-11-03 03:53:00,098 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 03:53:00,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 03:53:00,102 INFO L168 Benchmark]: Toolchain (without parser) took 1622.21 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 75.7 MB in the beginning and 92.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:53:00,103 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 109.1 MB. Free memory was 61.7 MB in the beginning and 61.6 MB in the end (delta: 54.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:53:00,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.09 ms. Allocated memory is still 109.1 MB. Free memory was 75.6 MB in the beginning and 82.0 MB in the end (delta: -6.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 03:53:00,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.16 ms. Allocated memory is still 109.1 MB. Free memory was 82.0 MB in the beginning and 80.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:53:00,110 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 109.1 MB. Free memory was 80.7 MB in the beginning and 79.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:53:00,111 INFO L168 Benchmark]: RCFGBuilder took 520.28 ms. Allocated memory is still 109.1 MB. Free memory was 79.1 MB in the beginning and 67.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-03 03:53:00,111 INFO L168 Benchmark]: TraceAbstraction took 752.11 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 67.0 MB in the beginning and 93.4 MB in the end (delta: -26.4 MB). Peak memory consumption was 610.4 kB. Max. memory is 16.1 GB. [2021-11-03 03:53:00,112 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 134.2 MB. Free memory is still 92.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:53:00,120 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.23 ms. Allocated memory is still 109.1 MB. Free memory was 61.7 MB in the beginning and 61.6 MB in the end (delta: 54.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 275.09 ms. Allocated memory is still 109.1 MB. Free memory was 75.6 MB in the beginning and 82.0 MB in the end (delta: -6.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.16 ms. Allocated memory is still 109.1 MB. Free memory was 82.0 MB in the beginning and 80.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 109.1 MB. Free memory was 80.7 MB in the beginning and 79.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 520.28 ms. Allocated memory is still 109.1 MB. Free memory was 79.1 MB in the beginning and 67.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 752.11 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 67.0 MB in the beginning and 93.4 MB in the end (delta: -26.4 MB). Peak memory consumption was 610.4 kB. Max. memory is 16.1 GB. * Witness Printer took 4.19 ms. Allocated memory is still 134.2 MB. Free memory is still 92.7 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 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __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_125=0, __return_main=0] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __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_125=0, __return_main=0] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0] [L51] reach_error() VAL [__return_125=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, 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: 33 SDtfs, 35 SDslu, 47 SDs, 0 SdLazy, 19 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s 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-03 03:53:00,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/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_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:53:02,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:53:02,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:53:02,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:53:02,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:53:02,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:53:02,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:53:02,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:53:02,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:53:02,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:53:02,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:53:02,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:53:02,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:53:02,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:53:02,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:53:02,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:53:02,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:53:02,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:53:02,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:53:02,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:53:02,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:53:02,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:53:02,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:53:02,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:53:02,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:53:02,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:53:02,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:53:02,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:53:02,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:53:02,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:53:02,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:53:02,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:53:02,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:53:02,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:53:02,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:53:02,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:53:02,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:53:02,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:53:02,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:53:02,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:53:02,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:53:02,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-03 03:53:02,662 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:53:02,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:53:02,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:53:02,664 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:53:02,664 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:53:02,665 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:53:02,665 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:53:02,666 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:53:02,666 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:53:02,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:53:02,667 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:53:02,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:53:02,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:53:02,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 03:53:02,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:53:02,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 03:53:02,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:53:02,670 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 03:53:02,671 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 03:53:02,671 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:53:02,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 03:53:02,672 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:53:02,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 03:53:02,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:53:02,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 03:53:02,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:53:02,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:53:02,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:53:02,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:53:02,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 03:53:02,674 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 03:53:02,674 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 03:53:02,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 03:53:02,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:53:02,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:53:02,675 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_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/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_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2021-11-03 03:53:03,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:53:03,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:53:03,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:53:03,098 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:53:03,098 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:53:03,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-03 03:53:03,173 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/4268872b1/36ce0bfeb95e4f5bac5efe1385951984/FLAG7a4a0c01b [2021-11-03 03:53:03,680 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:53:03,681 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-11-03 03:53:03,690 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/4268872b1/36ce0bfeb95e4f5bac5efe1385951984/FLAG7a4a0c01b [2021-11-03 03:53:04,015 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/data/4268872b1/36ce0bfeb95e4f5bac5efe1385951984 [2021-11-03 03:53:04,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:53:04,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:53:04,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:53:04,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:53:04,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:53:04,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2304bfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04, skipping insertion in model container [2021-11-03 03:53:04,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:53:04,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:53:04,221 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_20a74b39-9bed-44a1-a138-7ab2d9811a01/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-03 03:53:04,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:53:04,255 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:53:04,299 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_20a74b39-9bed-44a1-a138-7ab2d9811a01/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-11-03 03:53:04,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:53:04,355 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:53:04,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04 WrapperNode [2021-11-03 03:53:04,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:53:04,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:53:04,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:53:04,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:53:04,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:53:04,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:53:04,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:53:04,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:53:04,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:53:04,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:53:04,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:53:04,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:53:04,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (1/1) ... [2021-11-03 03:53:04,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:53:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:53:04,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:53:04,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:53:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-03 03:53:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 03:53:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:53:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-03 03:53:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:53:04,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:53:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:53:07,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:53:07,209 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 03:53:07,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:07 BoogieIcfgContainer [2021-11-03 03:53:07,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:53:07,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:53:07,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:53:07,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:53:07,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:53:04" (1/3) ... [2021-11-03 03:53:07,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679331e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:53:07, skipping insertion in model container [2021-11-03 03:53:07,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:04" (2/3) ... [2021-11-03 03:53:07,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679331e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:53:07, skipping insertion in model container [2021-11-03 03:53:07,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:07" (3/3) ... [2021-11-03 03:53:07,219 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2021-11-03 03:53:07,225 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:53:07,225 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 03:53:07,272 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:53:07,278 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-03 03:53:07,278 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 03:53:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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-03 03:53:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:53:07,297 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:07,298 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:07,299 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 03:53:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-11-03 03:53:07,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:07,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312626854] [2021-11-03 03:53:07,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:07,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:07,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:07,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 03:53:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 03:53:07,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:07,869 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-03 03:53:07,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:07,926 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-03 03:53:07,927 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:07,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312626854] [2021-11-03 03:53:07,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312626854] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:07,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:07,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-03 03:53:07,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343490997] [2021-11-03 03:53:07,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:53:07,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:53:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:53:07,950 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) 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-03 03:53:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:11,706 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2021-11-03 03:53:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:53:11,744 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-03 03:53:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:11,752 INFO L225 Difference]: With dead ends: 54 [2021-11-03 03:53:11,753 INFO L226 Difference]: Without dead ends: 34 [2021-11-03 03:53:11,755 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-03 03:53:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-03 03:53:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2021-11-03 03:53:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-03 03:53:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-03 03:53:11,784 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2021-11-03 03:53:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:11,784 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-03 03:53:11,785 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-03 03:53:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-03 03:53:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:53:11,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:11,786 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:11,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-03 03:53:11,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:11,988 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 03:53:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2021-11-03 03:53:11,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:11,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369085364] [2021-11-03 03:53:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:11,990 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:11,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:11,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:12,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 03:53:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:12,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 03:53:12,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:12,459 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-03 03:53:12,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:53:12,563 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-03 03:53:12,563 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:53:12,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369085364] [2021-11-03 03:53:12,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369085364] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:53:12,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:53:12,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-03 03:53:12,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190978422] [2021-11-03 03:53:12,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 03:53:12,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:53:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 03:53:12,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:53:12,573 INFO L87 Difference]: Start difference. First operand 18 states and 22 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-03 03:53:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:53:15,698 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-11-03 03:53:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:53:15,699 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-03 03:53:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:53:15,700 INFO L225 Difference]: With dead ends: 22 [2021-11-03 03:53:15,700 INFO L226 Difference]: Without dead ends: 18 [2021-11-03 03:53:15,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:53:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-03 03:53:15,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-03 03:53:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:53:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-11-03 03:53:15,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2021-11-03 03:53:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:53:15,705 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-11-03 03:53:15,705 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-03 03:53:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2021-11-03 03:53:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:53:15,706 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:53:15,706 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:53:15,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 03:53:15,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:53:15,907 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 03:53:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:53:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-11-03 03:53:15,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:53:15,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493955496] [2021-11-03 03:53:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:53:15,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:53:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:53:15,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:53:15,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 03:53:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:53:16,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-03 03:53:16,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:53:18,352 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:53:18,353 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-03 03:54:02,967 WARN L207 SmtUtils]: Spent 11.72 s on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2021-11-03 03:55:03,187 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-03 03:55:05,210 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-03 03:57:51,392 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-03 03:57:51,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:58:00,993 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-03 03:58:13,085 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-03 03:58:15,140 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-03 03:58:25,464 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-03 03:58:27,519 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-03 03:58:37,869 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-03 03:58:39,922 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-03 03:58:54,452 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-03 03:58:56,515 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-03 03:59:12,708 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-03 03:59:14,760 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-03 03:59:28,943 WARN L207 SmtUtils]: Spent 14.15 s on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2021-11-03 03:59:28,943 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-03 03:59:28,944 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-03 04:00:36,479 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (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.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) is different from false [2021-11-03 04:00:38,529 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (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.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) is different from true [2021-11-03 04:00:38,530 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-03 04:00:38,530 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:00:38,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493955496] [2021-11-03 04:00:38,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493955496] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:00:38,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:00:38,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-03 04:00:38,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427755077] [2021-11-03 04:00:38,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 04:00:38,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:00:38,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 04:00:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=78, Unknown=17, NotChecked=200, Total=342 [2021-11-03 04:00:38,534 INFO L87 Difference]: Start difference. First operand 18 states and 21 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-03 04:00:42,151 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (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.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-03 04:00:44,207 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (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.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-03 04:00:46,244 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-03 04:00:48,305 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-03 04:00:50,346 WARN L838 $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 false [2021-11-03 04:00:52,414 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-03 04:00:55,380 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-03 04:00:58,192 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-03 04:01:00,236 WARN L838 $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 false [2021-11-03 04:01:02,296 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-03 04:01:04,888 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-03 04:01:06,956 WARN L838 $PredicateComparison]: unable to prove that (and (= 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-03 04:01:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:01:11,904 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-11-03 04:01:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:01:11,908 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-03 04:01:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:01:11,909 INFO L225 Difference]: With dead ends: 31 [2021-11-03 04:01:11,910 INFO L226 Difference]: Without dead ends: 26 [2021-11-03 04:01:11,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 89.7s TimeCoverageRelationStatistics Valid=63, Invalid=82, Unknown=29, NotChecked=528, Total=702 [2021-11-03 04:01:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-03 04:01:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-11-03 04:01:11,916 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-03 04:01:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-03 04:01:11,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-03 04:01:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:01:11,918 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-03 04:01:11,918 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-03 04:01:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-03 04:01:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 04:01:11,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:01:11,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:01:11,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-03 04:01:12,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:01:12,133 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:01:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:01:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2021-11-03 04:01:12,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:01:12,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226767553] [2021-11-03 04:01:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:01:12,134 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:01:12,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:01:12,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:01:12,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20a74b39-9bed-44a1-a138-7ab2d9811a01/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 04:01:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:01:12,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-03 04:01:12,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:01:15,165 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 04:01:15,165 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-03 04:01:35,609 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-03 04:02:15,926 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-03 04:03:33,175 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-03 04:03:35,207 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-03 04:07:15,162 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-03 04:07:15,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:07:29,639 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-03 04:07:31,700 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