./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI --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 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:15:02,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:15:02,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:15:02,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:15:02,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:15:02,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:15:02,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:15:02,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:15:02,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:15:02,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:15:02,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:15:02,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:15:02,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:15:02,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:15:02,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:15:02,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:15:02,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:15:02,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:15:02,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:15:02,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:15:02,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:15:02,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:15:02,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:15:02,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:15:02,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:15:02,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:15:02,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:15:02,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:15:02,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:15:02,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:15:02,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:15:02,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:15:02,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:15:02,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:15:02,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:15:02,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:15:02,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:15:02,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:15:02,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:15:02,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:15:02,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:15:02,376 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:15:02,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:15:02,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:15:02,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:15:02,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:15:02,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:15:02,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:15:02,415 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:15:02,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:15:02,416 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:15:02,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:15:02,416 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:15:02,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:15:02,417 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:15:02,417 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:15:02,417 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:15:02,417 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:15:02,417 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:15:02,418 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:15:02,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:15:02,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:15:02,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:15:02,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:15:02,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:15:02,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:15:02,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:15:02,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:15:02,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:15:02,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:15:02,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:15:02,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:15:02,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:15:02,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:15:02,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:02,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:15:02,427 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:15:02,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:15:02,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:15:02,427 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:15:02,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:15:02,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:15:02,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:15:02,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/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_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI 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 -> 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 [2022-11-03 02:15:02,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:15:02,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:15:02,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:15:02,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:15:02,734 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:15:02,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2022-11-03 02:15:02,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/3dff6ce0a/bd584b55f17a4854b1f6d2aaf4dc2ae0/FLAG1de1f5c17 [2022-11-03 02:15:03,243 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:15:03,244 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2022-11-03 02:15:03,252 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/3dff6ce0a/bd584b55f17a4854b1f6d2aaf4dc2ae0/FLAG1de1f5c17 [2022-11-03 02:15:03,664 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/3dff6ce0a/bd584b55f17a4854b1f6d2aaf4dc2ae0 [2022-11-03 02:15:03,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:15:03,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:15:03,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:03,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:15:03,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:15:03,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488a3422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03, skipping insertion in model container [2022-11-03 02:15:03,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:15:03,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:15:03,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2022-11-03 02:15:03,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:03,904 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:15:03,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2022-11-03 02:15:03,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:03,944 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:15:03,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03 WrapperNode [2022-11-03 02:15:03,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:03,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:03,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:15:03,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:15:03,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,984 INFO L138 Inliner]: procedures = 18, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-11-03 02:15:03,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:03,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:15:03,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:15:03,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:15:03,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:03,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:04,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:04,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:04,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:04,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:04,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:15:04,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:15:04,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:15:04,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:15:04,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (1/1) ... [2022-11-03 02:15:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:04,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:04,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:15:04,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:15:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:15:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:15:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:15:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-03 02:15:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:15:04,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:15:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-03 02:15:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:15:04,163 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:15:04,165 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:15:04,359 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:15:04,374 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:15:04,386 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:15:04,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:04 BoogieIcfgContainer [2022-11-03 02:15:04,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:15:04,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:15:04,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:15:04,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:15:04,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:15:03" (1/3) ... [2022-11-03 02:15:04,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d09828c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:04, skipping insertion in model container [2022-11-03 02:15:04,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:03" (2/3) ... [2022-11-03 02:15:04,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d09828c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:04, skipping insertion in model container [2022-11-03 02:15:04,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:04" (3/3) ... [2022-11-03 02:15:04,413 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2022-11-03 02:15:04,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:15:04,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:15:04,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:15:04,547 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3dfee571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:15:04,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:15:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:15:04,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:04,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:04,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2022-11-03 02:15:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:04,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735804818] [2022-11-03 02:15:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:04,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:04,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735804818] [2022-11-03 02:15:04,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735804818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:04,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:04,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:15:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896264908] [2022-11-03 02:15:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:04,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:15:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:15:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:15:04,914 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:05,021 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-11-03 02:15:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:15:05,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:15:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:05,033 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:15:05,034 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:15:05,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:15:05,040 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:05,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:15:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:15:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 02:15:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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) [2022-11-03 02:15:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-11-03 02:15:05,075 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-11-03 02:15:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:05,076 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-03 02:15:05,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-11-03 02:15:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:15:05,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:05,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:05,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:15:05,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2022-11-03 02:15:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:05,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784390138] [2022-11-03 02:15:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:15:05,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:15:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:15:05,131 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:15:05,132 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:15:05,133 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:15:05,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:15:05,139 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-03 02:15:05,143 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:15:05,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:15:05 BoogieIcfgContainer [2022-11-03 02:15:05,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:15:05,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:15:05,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:15:05,171 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:15:05,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:04" (3/4) ... [2022-11-03 02:15:05,175 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:15:05,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:15:05,176 INFO L158 Benchmark]: Toolchain (without parser) took 1507.67ms. Allocated memory is still 98.6MB. Free memory was 56.7MB in the beginning and 59.6MB in the end (delta: -3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:15:05,176 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:15:05,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.36ms. Allocated memory is still 98.6MB. Free memory was 56.5MB in the beginning and 73.3MB in the end (delta: -16.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 02:15:05,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.13ms. Allocated memory is still 98.6MB. Free memory was 73.3MB in the beginning and 71.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:15:05,178 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 98.6MB. Free memory was 71.3MB in the beginning and 70.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:15:05,179 INFO L158 Benchmark]: RCFGBuilder took 376.15ms. Allocated memory is still 98.6MB. Free memory was 70.0MB in the beginning and 56.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:15:05,179 INFO L158 Benchmark]: TraceAbstraction took 778.86ms. Allocated memory is still 98.6MB. Free memory was 56.0MB in the beginning and 60.2MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:15:05,180 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 98.6MB. Free memory was 60.2MB in the beginning and 59.6MB in the end (delta: 520.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:15:05,183 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.29ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.36ms. Allocated memory is still 98.6MB. Free memory was 56.5MB in the beginning and 73.3MB in the end (delta: -16.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.13ms. Allocated memory is still 98.6MB. Free memory was 73.3MB in the beginning and 71.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 98.6MB. Free memory was 71.3MB in the beginning and 70.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.15ms. Allocated memory is still 98.6MB. Free memory was 70.0MB in the beginning and 56.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 778.86ms. Allocated memory is still 98.6MB. Free memory was 56.0MB in the beginning and 60.2MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 98.6MB. Free memory was 60.2MB in the beginning and 59.6MB in the end (delta: 520.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 32, 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_132; [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_132=0, __return_main=0, main__max={5:0}, main__min={4:0}, main__min[0]=56] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_132=0, __return_main=0, main__max={5:0}, main__max[4UL]=57, main__min={4:0}] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L30] COND TRUE main__i < 5UL [L32] EXPR main__max[main__i] VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}] [L32] 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_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4: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_132=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_132=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L51] reach_error() VAL [__return_132=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2022-11-03 02:15:05,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI --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 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:15:07,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:15:07,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:15:07,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:15:07,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:15:07,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:15:07,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:15:07,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:15:07,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:15:07,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:15:07,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:15:07,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:15:07,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:15:07,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:15:07,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:15:07,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:15:07,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:15:07,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:15:07,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:15:07,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:15:07,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:15:07,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:15:07,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:15:07,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:15:07,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:15:07,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:15:07,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:15:07,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:15:07,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:15:07,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:15:07,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:15:07,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:15:07,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:15:07,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:15:07,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:15:07,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:15:07,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:15:07,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:15:07,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:15:07,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:15:07,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:15:07,710 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:15:07,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:15:07,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:15:07,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:15:07,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:15:07,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:15:07,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:15:07,754 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:15:07,754 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:15:07,755 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:15:07,755 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:15:07,756 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:15:07,756 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:15:07,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:15:07,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:15:07,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:15:07,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:15:07,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:15:07,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:15:07,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:15:07,760 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:15:07,760 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:15:07,760 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:15:07,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:15:07,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:15:07,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:15:07,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:15:07,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:15:07,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:15:07,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:15:07,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:07,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:15:07,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:15:07,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:15:07,764 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:15:07,764 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:15:07,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:15:07,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:15:07,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:15:07,765 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_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/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_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI 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 -> 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 [2022-11-03 02:15:08,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:15:08,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:15:08,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:15:08,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:15:08,230 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:15:08,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2022-11-03 02:15:08,315 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/c26882984/417293bf2c964eb38d61076d5f5f6265/FLAGc1e73b9cf [2022-11-03 02:15:08,854 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:15:08,855 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2022-11-03 02:15:08,862 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/c26882984/417293bf2c964eb38d61076d5f5f6265/FLAGc1e73b9cf [2022-11-03 02:15:09,201 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/data/c26882984/417293bf2c964eb38d61076d5f5f6265 [2022-11-03 02:15:09,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:15:09,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:15:09,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:09,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:15:09,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:15:09,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db74626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09, skipping insertion in model container [2022-11-03 02:15:09,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:15:09,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:15:09,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2022-11-03 02:15:09,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:09,497 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:15:09,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2022-11-03 02:15:09,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:09,539 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:15:09,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09 WrapperNode [2022-11-03 02:15:09,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:09,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:09,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:15:09,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:15:09,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,606 INFO L138 Inliner]: procedures = 19, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2022-11-03 02:15:09,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:09,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:15:09,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:15:09,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:15:09,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,663 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:15:09,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:15:09,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:15:09,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:15:09,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (1/1) ... [2022-11-03 02:15:09,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:09,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:09,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:15:09,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:15:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:15:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-11-03 02:15:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:15:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:15:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-11-03 02:15:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:15:09,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:15:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:15:09,874 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:15:09,875 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:15:12,653 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:15:12,658 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:15:12,659 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:15:12,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:12 BoogieIcfgContainer [2022-11-03 02:15:12,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:15:12,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:15:12,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:15:12,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:15:12,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:15:09" (1/3) ... [2022-11-03 02:15:12,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743e9ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:12, skipping insertion in model container [2022-11-03 02:15:12,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:09" (2/3) ... [2022-11-03 02:15:12,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743e9ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:12, skipping insertion in model container [2022-11-03 02:15:12,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:12" (3/3) ... [2022-11-03 02:15:12,670 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2022-11-03 02:15:12,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:15:12,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:15:12,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:15:12,743 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49ed796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:15:12,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:15:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:15:12,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:12,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:12,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-11-03 02:15:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:15:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99728418] [2022-11-03 02:15:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:12,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:15:12,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:15:12,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:15:12,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:15:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:13,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:15:13,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:13,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:15:13,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:15:13,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99728418] [2022-11-03 02:15:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99728418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:13,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:13,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:15:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237918157] [2022-11-03 02:15:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:13,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:15:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:15:13,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:15:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:15:13,287 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:15,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:15:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:15,523 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-11-03 02:15:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:15:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:15:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:15,535 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:15:15,535 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 02:15:15,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:15:15,541 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:15,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 102 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 02:15:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 02:15:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-03 02:15:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-11-03 02:15:15,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2022-11-03 02:15:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:15,577 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-03 02:15:15,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-11-03 02:15:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:15:15,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:15,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:15,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 02:15:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:15:15,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2022-11-03 02:15:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:15:15,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456374924] [2022-11-03 02:15:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:15,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:15:15,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:15:15,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:15:15,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:15:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:16,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 02:15:16,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:18,248 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:15:18,249 INFO L390 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 [2022-11-03 02:15:29,433 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_2 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:15:51,758 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-11-03 02:15:53,781 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-11-03 02:16:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:59,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:16:59,560 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:16:59,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456374924] [2022-11-03 02:16:59,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456374924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:59,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:59,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:16:59,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104147954] [2022-11-03 02:16:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:59,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:16:59,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:16:59,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:16:59,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2022-11-03 02:16:59,562 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:01,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:17:03,359 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse4 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= .cse0 (let ((.cse1 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (= .cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse7 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse5 .cse6) (= .cse7 .cse8) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse7) (fp.sub c_currentRoundingMode .cse6 .cse7)) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse7)))) (= .cse5 (let ((.cse9 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse8 .cse4) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 02:17:05,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:17:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:06,187 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-03 02:17:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:17:06,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:17:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:06,189 INFO L225 Difference]: With dead ends: 31 [2022-11-03 02:17:06,189 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:17:06,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=32, Invalid=48, Unknown=4, NotChecked=48, Total=132 [2022-11-03 02:17:06,191 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:06,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 54 Unchecked, 4.5s Time] [2022-11-03 02:17:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:17:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-03 02:17:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-03 02:17:06,200 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2022-11-03 02:17:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:06,200 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-03 02:17:06,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-03 02:17:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:17:06,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:06,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:06,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-03 02:17:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:17:06,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2022-11-03 02:17:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:17:06,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545119994] [2022-11-03 02:17:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:06,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:17:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:17:06,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:17:06,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:17:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:07,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:17:07,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:09,586 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:17:09,587 INFO L390 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 [2022-11-03 02:17:20,254 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:17:35,880 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:18:04,626 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from false [2022-11-03 02:18:06,650 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from true [2022-11-03 02:18:58,634 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2022-11-03 02:19:00,658 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2022-11-03 02:19:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:19:21,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:19:21,992 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:19:21,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545119994] [2022-11-03 02:19:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545119994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:19:21,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:19:21,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:19:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248328263] [2022-11-03 02:19:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:21,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:19:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:19:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:19:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2022-11-03 02:19:21,995 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:23,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:20:20,221 WARN L234 SmtUtils]: Spent 49.54s on a formula simplification. DAG size of input: 81 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:20:22,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:20:24,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:20:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:24,735 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-11-03 02:20:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:20:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:20:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:24,738 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:20:24,738 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 02:20:24,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=40, Invalid=59, Unknown=7, NotChecked=76, Total=182 [2022-11-03 02:20:24,740 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:24,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 2 Unknown, 113 Unchecked, 5.8s Time] [2022-11-03 02:20:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 02:20:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-11-03 02:20:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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) [2022-11-03 02:20:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-03 02:20:24,746 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-11-03 02:20:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:24,747 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-03 02:20:24,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-03 02:20:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:20:24,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:24,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:24,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:24,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:20:24,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:20:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash -252887217, now seen corresponding path program 1 times [2022-11-03 02:20:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:20:24,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888641384] [2022-11-03 02:20:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:24,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:20:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:20:24,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:20:24,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:20:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:25,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:20:25,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:20:28,381 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:20:28,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 98 [2022-11-03 02:21:02,766 WARN L234 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:21:27,530 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse2 .cse0) (= .cse3 .cse2) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse1 .cse3))) (_ +zero 11 53)))))) is different from false [2022-11-03 02:21:29,546 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse2 .cse0) (= .cse3 .cse2) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse1 .cse3))) (_ +zero 11 53)))))) is different from true [2022-11-03 02:21:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:44,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:44,319 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:44,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888641384] [2022-11-03 02:21:44,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888641384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:44,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:44,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:21:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690211164] [2022-11-03 02:21:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:44,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:21:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:21:44,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=4, NotChecked=20, Total=156 [2022-11-03 02:21:44,322 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:46,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:21:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:47,121 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-03 02:21:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:21:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:21:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:47,123 INFO L225 Difference]: With dead ends: 29 [2022-11-03 02:21:47,124 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:21:47,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=4, NotChecked=20, Total=156 [2022-11-03 02:21:47,125 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:47,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 1 Unknown, 51 Unchecked, 2.8s Time] [2022-11-03 02:21:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:21:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 02:21:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-03 02:21:47,131 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-11-03 02:21:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:47,132 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-03 02:21:47,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-03 02:21:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:21:47,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:47,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:47,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:47,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:21:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:47,355 INFO L85 PathProgramCache]: Analyzing trace with hash 233583923, now seen corresponding path program 1 times [2022-11-03 02:21:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:47,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396072078] [2022-11-03 02:21:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:47,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:47,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:47,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:47,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:21:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:48,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:21:48,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:51,590 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:21:51,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 109 [2022-11-03 02:22:40,666 WARN L234 SmtUtils]: Spent 15.63s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:22:58,618 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))) (= .cse2 .cse3) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse3 .cse1)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:23:31,550 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse1 .cse2) (= .cse3 .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq .cse4 (_ +zero 11 53)) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from false [2022-11-03 02:23:33,569 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse1 .cse2) (= .cse3 .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq .cse4 (_ +zero 11 53)) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from true [2022-11-03 02:25:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:25:05,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:25:05,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:25:05,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396072078] [2022-11-03 02:25:05,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396072078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:05,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:05,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:25:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010595007] [2022-11-03 02:25:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:05,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:25:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:25:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:25:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=8, NotChecked=42, Total=182 [2022-11-03 02:25:05,173 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second 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) [2022-11-03 02:25:07,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:25:29,909 WARN L234 SmtUtils]: Spent 12.47s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:25:32,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:25:34,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:25:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:34,526 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-11-03 02:25:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:25:34,528 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 16 [2022-11-03 02:25:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:34,529 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:25:34,529 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 02:25:34,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 71.9s TimeCoverageRelationStatistics Valid=49, Invalid=105, Unknown=10, NotChecked=46, Total=210 [2022-11-03 02:25:34,530 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:34,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 2 Unknown, 72 Unchecked, 7.0s Time] [2022-11-03 02:25:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 02:25:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-11-03 02:25:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:25:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-11-03 02:25:34,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2022-11-03 02:25:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:34,543 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-11-03 02:25:34,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-11-03 02:25:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-11-03 02:25:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:25:34,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:34,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:34,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:25:34,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:25:34,751 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:25:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1916934988, now seen corresponding path program 1 times [2022-11-03 02:25:34,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:25:34,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070916667] [2022-11-03 02:25:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:25:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:25:34,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:25:34,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:25:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:35,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:25:35,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:25:40,030 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:25:40,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 248 treesize of output 120 [2022-11-03 02:25:53,552 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19)))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21)))) (exists ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv30 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse1) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:25:55,584 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19)))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21)))) (exists ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv30 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse1) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-03 02:26:22,415 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse2 .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse0 .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse1)))) is different from false [2022-11-03 02:26:24,461 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse2 .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse0 .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse1)))) is different from true [2022-11-03 02:27:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:42,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:27:42,867 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:27:42,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070916667] [2022-11-03 02:27:42,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070916667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:27:42,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:27:42,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:27:42,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836016956] [2022-11-03 02:27:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:27:42,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:27:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:27:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:27:42,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=112, Unknown=4, NotChecked=46, Total=210 [2022-11-03 02:27:42,870 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second 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) [2022-11-03 02:27:44,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:29:37,437 WARN L234 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 137 DAG size of output: 116 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:29:40,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:29:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:40,534 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-03 02:29:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:29:40,536 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 17 [2022-11-03 02:29:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:40,537 INFO L225 Difference]: With dead ends: 30 [2022-11-03 02:29:40,537 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:29:40,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 122.8s TimeCoverageRelationStatistics Valid=54, Invalid=124, Unknown=12, NotChecked=50, Total=240 [2022-11-03 02:29:40,538 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:40,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 17 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 1 Unknown, 45 Unchecked, 5.1s Time] [2022-11-03 02:29:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:29:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-03 02:29:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:29:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-03 02:29:40,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-11-03 02:29:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:40,547 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-03 02:29:40,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-11-03 02:29:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-03 02:29:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:29:40,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:40,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:40,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:40,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:29:40,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:40,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 187710574, now seen corresponding path program 1 times [2022-11-03 02:29:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:29:40,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915615108] [2022-11-03 02:29:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:40,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:29:40,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:29:40,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:29:40,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1411cc-055a-4ec4-af3c-ce6859d2262f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:29:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:41,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:29:41,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:46,382 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:29:46,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 248 treesize of output 120