./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:58:26,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:58:26,525 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 12:58:26,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:58:26,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:58:26,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:58:26,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:58:26,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:58:26,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:58:26,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:58:26,556 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:58:26,557 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:58:26,557 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:58:26,558 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:58:26,558 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:58:26,559 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:58:26,559 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:58:26,560 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:58:26,560 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:58:26,561 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:58:26,561 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:58:26,562 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:58:26,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:58:26,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:58:26,564 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:58:26,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:58:26,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:58:26,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:58:26,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:58:26,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:58:26,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:58:26,566 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:58:26,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:58:26,567 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:58:26,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:58:26,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:58:26,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:58:26,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:58:26,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:58:26,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:58:26,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:58:26,569 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:58:26,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:58:26,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:58:26,569 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:58:26,570 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:58:26,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:58:26,570 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/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_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 [2023-12-02 12:58:26,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:58:26,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:58:26,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:58:26,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:58:26,815 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:58:26,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i [2023-12-02 12:58:29,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:58:29,753 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:58:29,754 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i [2023-12-02 12:58:29,761 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data/6a0cd4e27/4c0242946f5d447e837880565fd6ffca/FLAGe555afef3 [2023-12-02 12:58:29,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data/6a0cd4e27/4c0242946f5d447e837880565fd6ffca [2023-12-02 12:58:29,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:58:29,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:58:29,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:58:29,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:58:29,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:58:29,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:58:29" (1/1) ... [2023-12-02 12:58:29,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1ce899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:29, skipping insertion in model container [2023-12-02 12:58:29,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:58:29" (1/1) ... [2023-12-02 12:58:29,804 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:58:29,921 WARN L240 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2023-12-02 12:58:29,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:58:29,967 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:58:29,978 WARN L240 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2023-12-02 12:58:29,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:58:30,012 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:58:30,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30 WrapperNode [2023-12-02 12:58:30,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:58:30,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:58:30,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:58:30,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:58:30,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,058 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2023-12-02 12:58:30,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:58:30,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:58:30,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:58:30,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:58:30,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:58:30,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:58:30,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:58:30,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:58:30,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (1/1) ... [2023-12-02 12:58:30,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:58:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:30,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:58:30,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:58:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:58:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 12:58:30,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 12:58:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:58:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:58:30,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:58:30,243 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:58:30,245 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:58:30,459 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:58:30,566 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:58:30,566 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 12:58:30,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:30 BoogieIcfgContainer [2023-12-02 12:58:30,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:58:30,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:58:30,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:58:30,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:58:30,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:58:29" (1/3) ... [2023-12-02 12:58:30,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25810e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:58:30, skipping insertion in model container [2023-12-02 12:58:30,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:30" (2/3) ... [2023-12-02 12:58:30,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25810e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:58:30, skipping insertion in model container [2023-12-02 12:58:30,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:30" (3/3) ... [2023-12-02 12:58:30,578 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-30.i [2023-12-02 12:58:30,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:58:30,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:58:30,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:58:30,652 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=LoopHeads, 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;@4f1fd90b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:58:30,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:58:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 12:58:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 12:58:30,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:30,665 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:30,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:30,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash -578140591, now seen corresponding path program 1 times [2023-12-02 12:58:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059579967] [2023-12-02 12:58:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:30,796 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 12:58:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980433885] [2023-12-02 12:58:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:30,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:30,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:30,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:30,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:58:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 12:58:30,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 12:58:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 12:58:31,054 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 12:58:31,056 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 12:58:31,057 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 12:58:31,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:58:31,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 12:58:31,264 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 12:58:31,266 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 12:58:31,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:58:31 BoogieIcfgContainer [2023-12-02 12:58:31,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 12:58:31,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 12:58:31,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 12:58:31,296 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 12:58:31,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:30" (3/4) ... [2023-12-02 12:58:31,297 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 12:58:31,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 12:58:31,299 INFO L158 Benchmark]: Toolchain (without parser) took 1522.74ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 101.9MB in the end (delta: 2.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2023-12-02 12:58:31,299 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:58:31,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.81ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 92.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 12:58:31,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.92ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:58:31,301 INFO L158 Benchmark]: Boogie Preprocessor took 30.78ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:58:31,301 INFO L158 Benchmark]: RCFGBuilder took 477.49ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 66.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 12:58:31,302 INFO L158 Benchmark]: TraceAbstraction took 723.33ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 102.9MB in the end (delta: -38.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:58:31,302 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.9MB in the end (delta: 953.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:58:31,305 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.81ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 92.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.92ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.78ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.49ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 66.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 723.33ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 102.9MB in the end (delta: -38.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.9MB in the end (delta: 953.8kB). 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = -32; [L26] unsigned char var_1_7 = 100; [L27] signed long int var_1_8 = 32; [L28] float var_1_10 = 255.3; [L29] float var_1_13 = 2.8; [L30] signed long int last_1_var_1_8 = 32; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L79] last_1_var_1_8 = var_1_8 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=-32, var_1_7=100, var_1_8=32] [L66] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=-32, var_1_7=100, var_1_8=32] [L67] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L67] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=-32, var_1_7=100, var_1_8=32] [L68] var_1_6 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=100, var_1_8=32] [L70] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L70] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=100, var_1_8=32] [L71] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=100, var_1_8=32] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_8=32] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_8=32] [L74] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=2, var_1_8=32] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=2, var_1_8=32] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=2, var_1_8=32] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=2, var_1_8=32] [L90] RET updateVariables() [L91] CALL step() [L34] signed long int stepLocal_0 = (last_1_var_1_8 / var_1_5) % var_1_6; [L35] COND TRUE \read(var_1_2) [L36] COND TRUE last_1_var_1_8 > stepLocal_0 [L37] var_1_1 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_1; [L43] COND TRUE stepLocal_1 < var_1_5 [L44] var_1_8 = (var_1_1 - ((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1)))) [L48] COND FALSE !(((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1)) [L53] COND TRUE var_1_1 >= var_1_1 [L54] var_1_10 = var_1_13 [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((var_1_2 ? ((last_1_var_1_8 > ((last_1_var_1_8 / var_1_5) % var_1_6)) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((var_1_1 < var_1_5) ? (var_1_8 == ((signed long int) (var_1_1 - ((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1)))))) : (var_1_8 == ((signed long int) var_1_7)))) && ((((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1)) ? ((var_1_5 <= (var_1_8 + var_1_8)) ? (var_1_10 == ((float) var_1_13)) : 1) : ((var_1_1 >= var_1_1) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13)))) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=2, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=2, var_1_2=1, var_1_5=3, var_1_6=9, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2023-12-02 12:58:31,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:58:33,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:58:33,322 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 12:58:33,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:58:33,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:58:33,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:58:33,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:58:33,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:58:33,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:58:33,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:58:33,358 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:58:33,358 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:58:33,359 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:58:33,359 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:58:33,360 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:58:33,360 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:58:33,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:58:33,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:58:33,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:58:33,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:58:33,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:58:33,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:58:33,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:58:33,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:58:33,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:58:33,366 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 12:58:33,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 12:58:33,366 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:58:33,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:58:33,367 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:58:33,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:58:33,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 12:58:33,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:58:33,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:58:33,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:58:33,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:58:33,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:58:33,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:58:33,370 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 12:58:33,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 12:58:33,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:58:33,371 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:58:33,371 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:58:33,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:58:33,371 INFO L153 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/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_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 [2023-12-02 12:58:33,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:58:33,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:58:33,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:58:33,695 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:58:33,695 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:58:33,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i [2023-12-02 12:58:36,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:58:36,700 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:58:36,701 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i [2023-12-02 12:58:36,708 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data/52a97938a/8e2dc21547c547ca8d46fe8388ddf846/FLAGe6a2a98d9 [2023-12-02 12:58:36,720 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/data/52a97938a/8e2dc21547c547ca8d46fe8388ddf846 [2023-12-02 12:58:36,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:58:36,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:58:36,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:58:36,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:58:36,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:58:36,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:36,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c95e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36, skipping insertion in model container [2023-12-02 12:58:36,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:36,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:58:36,878 WARN L240 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2023-12-02 12:58:36,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:58:36,924 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:58:36,934 WARN L240 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_e43aad23-2a0d-4987-aff8-8afe3c552d05/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2023-12-02 12:58:36,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:58:36,966 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:58:36,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36 WrapperNode [2023-12-02 12:58:36,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:58:36,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:58:36,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:58:36,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:58:36,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:36,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,006 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2023-12-02 12:58:37,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:58:37,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:58:37,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:58:37,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:58:37,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:58:37,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:58:37,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:58:37,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:58:37,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (1/1) ... [2023-12-02 12:58:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:58:37,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:37,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:58:37,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:58:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:58:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 12:58:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 12:58:37,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 12:58:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:58:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:58:37,189 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:58:37,191 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:58:38,845 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:58:38,884 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:58:38,885 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 12:58:38,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:38 BoogieIcfgContainer [2023-12-02 12:58:38,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:58:38,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:58:38,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:58:38,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:58:38,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:58:36" (1/3) ... [2023-12-02 12:58:38,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b528bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:58:38, skipping insertion in model container [2023-12-02 12:58:38,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:36" (2/3) ... [2023-12-02 12:58:38,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b528bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:58:38, skipping insertion in model container [2023-12-02 12:58:38,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:38" (3/3) ... [2023-12-02 12:58:38,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-30.i [2023-12-02 12:58:38,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:58:38,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:58:38,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:58:38,966 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=LoopHeads, 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;@4969b108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:58:38,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:58:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 12:58:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 12:58:38,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:38,982 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:38,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:38,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 624855087, now seen corresponding path program 1 times [2023-12-02 12:58:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:58:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547332170] [2023-12-02 12:58:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:39,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:58:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:58:39,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:58:39,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 12:58:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:39,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 12:58:39,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-02 12:58:39,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:58:39,287 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:58:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547332170] [2023-12-02 12:58:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547332170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:39,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:58:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97778686] [2023-12-02 12:58:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:39,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 12:58:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:58:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 12:58:39,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 12:58:39,327 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 12:58:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:39,708 INFO L93 Difference]: Finished difference Result 69 states and 119 transitions. [2023-12-02 12:58:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 12:58:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-02 12:58:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:39,741 INFO L225 Difference]: With dead ends: 69 [2023-12-02 12:58:39,742 INFO L226 Difference]: Without dead ends: 34 [2023-12-02 12:58:39,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 12:58:39,749 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:39,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:58:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-02 12:58:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-02 12:58:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 12:58:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2023-12-02 12:58:39,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 70 [2023-12-02 12:58:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:39,795 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2023-12-02 12:58:39,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 12:58:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2023-12-02 12:58:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 12:58:39,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:39,800 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:39,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:58:40,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:58:40,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:40,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1704056433, now seen corresponding path program 1 times [2023-12-02 12:58:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:58:40,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939671592] [2023-12-02 12:58:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:40,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:58:40,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:58:40,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:58:40,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 12:58:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:40,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 12:58:40,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 12:58:40,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 12:58:41,385 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:58:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939671592] [2023-12-02 12:58:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939671592] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:58:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-02 12:58:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290252235] [2023-12-02 12:58:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:41,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:58:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:58:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:58:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-02 12:58:41,390 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 12:58:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:45,250 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2023-12-02 12:58:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:58:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-02 12:58:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:45,254 INFO L225 Difference]: With dead ends: 123 [2023-12-02 12:58:45,254 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 12:58:45,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-02 12:58:45,256 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:45,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 132 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 12:58:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 12:58:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 51. [2023-12-02 12:58:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 12:58:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2023-12-02 12:58:45,273 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 70 [2023-12-02 12:58:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:45,274 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2023-12-02 12:58:45,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 12:58:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2023-12-02 12:58:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 12:58:45,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:45,276 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:45,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 12:58:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:58:45,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:45,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1704116015, now seen corresponding path program 1 times [2023-12-02 12:58:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:58:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969720391] [2023-12-02 12:58:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:45,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:58:45,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:58:45,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:58:45,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 12:58:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:45,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 12:58:45,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 12:58:53,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:59:43,292 WARN L293 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:09,223 WARN L293 SmtUtils]: Spent 14.16s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:48,497 WARN L293 SmtUtils]: Spent 23.03s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:01:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 13:01:06,645 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:01:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969720391] [2023-12-02 13:01:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969720391] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:01:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2023-12-02 13:01:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807372131] [2023-12-02 13:01:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:01:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:01:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:01:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:01:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=185, Unknown=3, NotChecked=0, Total=240 [2023-12-02 13:01:06,648 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:01:09,618 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_7~0)) (.cse35 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse30 (bvneg .cse35)) (.cse36 (bvneg .cse2))) (let ((.cse20 (bvadd .cse36 .cse35)) (.cse22 (bvadd .cse36 .cse35 .cse30)) (.cse0 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse9 (bvslt .cse2 .cse35)) (.cse15 (bvslt .cse35 .cse0)) (.cse23 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse38 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse20 .cse38) .cse2) .cse22)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse38)))))) (.cse31 (bvadd .cse35 .cse30)) (.cse33 (bvadd (bvmul (_ bv2 32) .cse30) .cse35)) (.cse5 (= .cse35 .cse2)) (.cse6 (not (= (_ bv0 8) c_~var_1_2~0)))) (let ((.cse18 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse37 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse2 (bvmul .cse37 .cse31)) .cse33)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse37))))) .cse5 .cse6)) (.cse19 (bvsle .cse0 (bvadd (bvmul (_ bv2 32) .cse35) (bvmul (_ bv2 32) .cse36)))) (.cse24 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse34 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse34))) (not (bvsle (bvmul (bvmul .cse20 .cse34) .cse2) .cse22))))) (or .cse23 .cse6))) (.cse25 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse32))) (not (bvsle (bvmul .cse2 (bvmul .cse32 .cse31)) .cse33))))) .cse5)) (.cse17 (bvsle .cse0 (bvmul (_ bv2 32) c_~var_1_8~0))) (.cse13 (= c_~var_1_8~0 .cse2)) (.cse12 (not .cse15)) (.cse7 (= c_~var_1_8~0 .cse20)) (.cse8 (not .cse9)) (.cse4 (= c_~var_1_8~0 .cse31)) (.cse10 (or .cse5 .cse6)) (.cse3 (bvadd c_~var_1_8~0 .cse30))) (and (or (let ((.cse11 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse16 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse16) .cse2) .cse3)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse16))))))) (and (or (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse1))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse1) .cse2) .cse3))))) (and .cse4 .cse5)) (or (and (or (and .cse6 .cse7) .cse8) (or .cse9 (and .cse4 .cse10))) .cse11)) .cse12) (or (and (or (and .cse13 .cse6) .cse11) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse14 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse14) .cse2) .cse3)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse14)))))))) .cse15))) .cse17) (or (not (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse0)) (and .cse18 (or .cse8 .cse19 (and (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse20 .cse21) .cse2) .cse22)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse21))))))) .cse23) .cse15) (or .cse12 .cse24))) .cse25)) (or .cse12 (and .cse18 (or .cse8 .cse19 .cse24) .cse25)) (or .cse17 (let ((.cse29 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse28 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse29))))) (.cse27 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse29) .cse2) .cse3)) (.cse26 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse29))))) (and (or (and (or .cse26 (and .cse13 .cse27 .cse6)) .cse28) .cse15) (or .cse12 (and (or (and .cse27 .cse4 .cse5) .cse28) (or (and (or (and .cse27 .cse6 .cse7) .cse8) (or .cse9 (and .cse27 .cse4 .cse10))) .cse26))))))))))))) is different from true [2023-12-02 13:01:12,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:14,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:22,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:25,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:28,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:29,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:36,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:40,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:48,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:01:52,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:02:15,429 WARN L293 SmtUtils]: Spent 18.51s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:02:16,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:02:19,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:02:21,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:02:25,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:02:55,706 WARN L293 SmtUtils]: Spent 26.42s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:02:57,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:02:59,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:03,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:05,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:07,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:08,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:10,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:12,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:15,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:23,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:45,548 WARN L293 SmtUtils]: Spent 9.88s on a formula simplification. DAG size of input: 80 DAG size of output: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:03:52,184 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse21 ((_ zero_extend 24) c_~var_1_1~0)) (.cse2 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse0 ((_ sign_extend 16) c_~var_1_5~0)) (.cse22 (bvneg .cse2)) (.cse29 (bvneg .cse21))) (let ((.cse5 (= .cse21 .cse2)) (.cse6 (not (= (_ bv0 8) c_~var_1_2~0))) (.cse19 (bvadd .cse21 .cse29)) (.cse9 (bvslt .cse2 .cse21)) (.cse23 (bvadd .cse22 .cse21)) (.cse15 (bvslt .cse21 .cse0))) (let ((.cse17 (bvsle .cse0 (bvmul (_ bv2 32) c_~var_1_8~0))) (.cse13 (= c_~var_1_8~0 .cse2)) (.cse12 (not .cse15)) (.cse7 (= c_~var_1_8~0 .cse23)) (.cse8 (not .cse9)) (.cse4 (= c_~var_1_8~0 .cse19)) (.cse10 (or .cse5 .cse6)) (.cse3 (bvadd c_~var_1_8~0 .cse29))) (and (or (let ((.cse11 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse16 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse16) .cse2) .cse3)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse16))))))) (and (or (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse1))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse1) .cse2) .cse3))))) (and .cse4 .cse5)) (or (and (or (and .cse6 .cse7) .cse8) (or .cse9 (and .cse4 .cse10))) .cse11)) .cse12) (or (and (or (and .cse13 .cse6) .cse11) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse14 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse14) .cse2) .cse3)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse14)))))))) .cse15))) .cse17) (or (not (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse0)) (let ((.cse20 (bvadd (bvmul (_ bv2 32) .cse29) .cse21))) (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse18 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse2 (bvmul .cse18 .cse19)) .cse20)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse18))))) .cse5 .cse6) (or .cse8 (bvsle .cse0 (bvadd (bvmul (_ bv2 32) .cse21) (bvmul (_ bv2 32) .cse22))) (let ((.cse25 (bvadd .cse22 .cse21 .cse29))) (let ((.cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse28 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse23 .cse28) .cse2) .cse25)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse28))))))) (and (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse24 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse23 .cse24) .cse2) .cse25)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse24))))))) .cse26) .cse15) (or .cse12 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse27 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse27))) (not (bvsle (bvmul (bvmul .cse23 .cse27) .cse2) .cse25))))) (or .cse26 .cse6))))))) (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse30 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse30))) (not (bvsle (bvmul .cse2 (bvmul .cse30 .cse19)) .cse20))))) .cse5)))) (or .cse17 (let ((.cse34 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse33 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse34))))) (.cse32 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse34) .cse2) .cse3)) (.cse31 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse34))))) (and (or (and (or .cse31 (and .cse13 .cse32 .cse6)) .cse33) .cse15) (or .cse12 (and (or (and .cse32 .cse4 .cse5) .cse33) (or (and (or (and .cse32 .cse6 .cse7) .cse8) (or .cse9 (and .cse32 .cse4 .cse10))) .cse31)))))))))))) is different from true [2023-12-02 13:03:54,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:56,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:03:58,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:04:00,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:04:23,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:04:26,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:04:59,525 WARN L293 SmtUtils]: Spent 24.35s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:05:01,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:02,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:04,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:07,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:09,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:11,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:13,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:15,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:05:46,885 WARN L293 SmtUtils]: Spent 22.58s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:06:00,047 WARN L293 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:06:31,788 WARN L293 SmtUtils]: Spent 20.15s on a formula simplification. DAG size of input: 84 DAG size of output: 110 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:06:33,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:36,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:38,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:41,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:43,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:46,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:48,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:50,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:52,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:54,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:56,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:06:59,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:07:04,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:07:05,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:07:07,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:07:11,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:07:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:07:11,287 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2023-12-02 13:07:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:07:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-02 13:07:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:07:11,388 INFO L225 Difference]: With dead ends: 84 [2023-12-02 13:07:11,388 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 13:07:11,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 305.6s TimeCoverageRelationStatistics Valid=107, Invalid=432, Unknown=21, NotChecked=90, Total=650 [2023-12-02 13:07:11,390 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 58 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 155.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:07:11,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 214 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 26 Unknown, 27 Unchecked, 155.3s Time] [2023-12-02 13:07:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 13:07:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 53. [2023-12-02 13:07:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:07:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2023-12-02 13:07:11,403 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 70 [2023-12-02 13:07:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:07:11,404 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2023-12-02 13:07:11,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:07:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2023-12-02 13:07:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 13:07:11,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:07:11,406 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:07:11,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 13:07:11,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:07:11,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:07:11,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:07:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1711682929, now seen corresponding path program 1 times [2023-12-02 13:07:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:07:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363199197] [2023-12-02 13:07:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:11,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:07:11,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:07:11,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:07:11,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 13:07:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:07:11,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:07:11,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:07:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 13:07:22,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:07:22,508 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:07:22,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363199197] [2023-12-02 13:07:22,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363199197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:07:22,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:07:22,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 13:07:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825530813] [2023-12-02 13:07:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:07:22,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 13:07:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:07:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 13:07:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:07:22,511 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:07:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:07:43,479 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2023-12-02 13:07:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 13:07:43,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-02 13:07:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:07:43,482 INFO L225 Difference]: With dead ends: 85 [2023-12-02 13:07:43,482 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 13:07:43,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-12-02 13:07:43,484 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 113 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:07:43,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 110 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2023-12-02 13:07:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 13:07:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2023-12-02 13:07:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:07:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2023-12-02 13:07:43,494 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 70 [2023-12-02 13:07:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:07:43,495 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2023-12-02 13:07:43,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:07:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2023-12-02 13:07:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 13:07:43,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:07:43,496 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:07:43,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 13:07:43,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:07:43,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:07:43,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:07:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1761314735, now seen corresponding path program 1 times [2023-12-02 13:07:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:07:43,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475236797] [2023-12-02 13:07:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:07:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:07:43,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:07:43,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 13:07:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:07:43,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:07:43,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:07:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 13:07:58,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:07:58,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:07:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475236797] [2023-12-02 13:07:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475236797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:07:58,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:07:58,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 13:07:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918350206] [2023-12-02 13:07:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:07:58,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 13:07:58,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:07:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 13:07:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:07:58,361 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:08:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:08:13,513 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2023-12-02 13:08:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 13:08:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-02 13:08:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:08:13,523 INFO L225 Difference]: With dead ends: 143 [2023-12-02 13:08:13,523 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 13:08:13,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-12-02 13:08:13,525 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 93 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:08:13,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 104 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-02 13:08:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 13:08:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2023-12-02 13:08:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:08:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2023-12-02 13:08:13,535 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 70 [2023-12-02 13:08:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:08:13,535 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2023-12-02 13:08:13,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:08:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2023-12-02 13:08:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 13:08:13,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:08:13,536 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:08:13,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 13:08:13,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:08:13,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:08:13,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:08:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1768941231, now seen corresponding path program 1 times [2023-12-02 13:08:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:08:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827973503] [2023-12-02 13:08:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:08:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:08:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:08:13,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 13:08:13,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e43aad23-2a0d-4987-aff8-8afe3c552d05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 13:08:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:08:13,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 13:08:13,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:08:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-02 13:08:35,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:09:35,698 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:10:11,019 WARN L293 SmtUtils]: Spent 14.63s on a formula simplification. DAG size of input: 60 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:10:36,095 WARN L293 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 60 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:11:42,691 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:12:10,103 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:12:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 13:12:10,264 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:12:10,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827973503] [2023-12-02 13:12:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827973503] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:12:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 24 [2023-12-02 13:12:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690903285] [2023-12-02 13:12:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:12:10,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:12:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:12:10,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:12:10,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=428, Unknown=13, NotChecked=0, Total=552 [2023-12-02 13:12:10,267 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 13:12:19,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:22,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:25,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:27,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:29,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:30,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:33,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:36,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:48,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:12:54,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:13:03,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:13:08,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:13:28,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]