./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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_5b5141f9-fbae-4741-9529-a0284bea6c36/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 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:44:10,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:44:10,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:44:10,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:44:10,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:44:10,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:44:10,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:44:10,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:44:10,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:44:10,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:44:10,556 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:44:10,557 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:44:10,557 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:44:10,558 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:44:10,558 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:44:10,558 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:44:10,559 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:44:10,559 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:44:10,560 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:44:10,560 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:44:10,561 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:44:10,562 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:44:10,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:44:10,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:44:10,563 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:44:10,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:44:10,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:44:10,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:44:10,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:44:10,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:44:10,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:44:10,566 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:44:10,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:44:10,567 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:44:10,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:44:10,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:44:10,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:44:10,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:44:10,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:44:10,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:44:10,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:44:10,569 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:44:10,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:44:10,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:44:10,569 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:44:10,569 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:44:10,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:44:10,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_5b5141f9-fbae-4741-9529-a0284bea6c36/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_5b5141f9-fbae-4741-9529-a0284bea6c36/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 -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2023-12-02 17:44:10,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:44:10,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:44:10,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:44:10,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:44:10,818 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:44:10,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-12-02 17:44:13,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:44:13,702 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:44:13,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-12-02 17:44:13,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data/a0e40f2eb/b21ce0ec12194528a952ea8952e719eb/FLAG04c27654c [2023-12-02 17:44:13,725 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data/a0e40f2eb/b21ce0ec12194528a952ea8952e719eb [2023-12-02 17:44:13,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:44:13,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:44:13,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:44:13,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:44:13,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:44:13,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:13,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc54b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13, skipping insertion in model container [2023-12-02 17:44:13,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:13,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:44:13,882 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-12-02 17:44:13,907 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-12-02 17:44:13,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:44:13,922 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:44:13,933 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-12-02 17:44:13,945 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-12-02 17:44:13,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:44:13,958 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:44:13,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13 WrapperNode [2023-12-02 17:44:13,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:44:13,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:44:13,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:44:13,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:44:13,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:13,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:13,998 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-12-02 17:44:13,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:44:13,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:44:13,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:44:13,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:44:14,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:44:14,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:44:14,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:44:14,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:44:14,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (1/1) ... [2023-12-02 17:44:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:44:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:14,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:44:14,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:44:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:44:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-02 17:44:14,094 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-02 17:44:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-02 17:44:14,094 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-02 17:44:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:44:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:44:14,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:44:14,165 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:44:14,168 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:44:14,354 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:44:14,415 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:44:14,416 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:44:14,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:44:14 BoogieIcfgContainer [2023-12-02 17:44:14,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:44:14,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:44:14,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:44:14,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:44:14,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:44:13" (1/3) ... [2023-12-02 17:44:14,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa2e91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:44:14, skipping insertion in model container [2023-12-02 17:44:14,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:13" (2/3) ... [2023-12-02 17:44:14,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa2e91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:44:14, skipping insertion in model container [2023-12-02 17:44:14,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:44:14" (3/3) ... [2023-12-02 17:44:14,426 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2023-12-02 17:44:14,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:44:14,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 17:44:14,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:44:14,487 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;@218a434a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:44:14,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 17:44:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 17:44:14,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:14,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 17:44:14,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:44:14,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash -377832024, now seen corresponding path program 1 times [2023-12-02 17:44:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:44:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197939038] [2023-12-02 17:44:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:44:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:14,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:44:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197939038] [2023-12-02 17:44:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197939038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:44:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293924049] [2023-12-02 17:44:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:14,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:44:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:44:14,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:44:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:44:14,822 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:14,886 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-02 17:44:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:44:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 17:44:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:14,894 INFO L225 Difference]: With dead ends: 39 [2023-12-02 17:44:14,894 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 17:44:14,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:44:14,900 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:14,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:44:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 17:44:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-02 17:44:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-02 17:44:14,934 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2023-12-02 17:44:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:14,934 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-02 17:44:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-02 17:44:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:44:14,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:14,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:44:14,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:44:14,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1099445991, now seen corresponding path program 1 times [2023-12-02 17:44:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:44:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603886370] [2023-12-02 17:44:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:44:14,954 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 17:44:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097721262] [2023-12-02 17:44:14,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:14,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:44:14,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:44:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:15,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 17:44:15,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:15,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:44:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:15,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:44:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603886370] [2023-12-02 17:44:15,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 17:44:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097721262] [2023-12-02 17:44:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097721262] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:44:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [584480990] [2023-12-02 17:44:15,524 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 17:44:15,524 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:44:15,527 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:44:15,533 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:44:15,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:44:17,111 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:44:17,404 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '164#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= (+ |ULTIMATE.start_main1_~y~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= 1 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 17:44:17,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:44:17,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:44:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-02 17:44:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026486458] [2023-12-02 17:44:17,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:44:17,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 17:44:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:44:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 17:44:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:44:17,408 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:17,555 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-12-02 17:44:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:44:17,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 17:44:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:17,556 INFO L225 Difference]: With dead ends: 31 [2023-12-02 17:44:17,557 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 17:44:17,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:44:17,559 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:17,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 150 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:44:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 17:44:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 17:44:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-02 17:44:17,567 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2023-12-02 17:44:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:17,568 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-02 17:44:17,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-02 17:44:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:44:17,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:17,569 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:17,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:44:17,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:17,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:44:17,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1975388935, now seen corresponding path program 2 times [2023-12-02 17:44:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:44:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188243585] [2023-12-02 17:44:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:44:17,786 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 17:44:17,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703201827] [2023-12-02 17:44:17,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:44:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:17,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:17,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:44:17,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:44:17,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:44:17,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:44:17,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 17:44:17,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:42,997 WARN L293 SmtUtils]: Spent 16.53s on a formula simplification. DAG size of input: 165 DAG size of output: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:47:26,002 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse5 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse82 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse74 (mod .cse5 256))) (let ((.cse17 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse18 (<= 128 .cse74)) (.cse19 (<= .cse82 127)) (.cse10 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse14 (mod .cse1 256))) (let ((.cse31 (not (= .cse14 0))) (.cse32 (<= .cse14 127)) (.cse0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse60 (<= 128 .cse82)) (.cse7 (+ .cse14 (- 256))) (.cse9 (<= 128 .cse14)) (.cse8 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse3 (+ (- 256) (mod (+ .cse1 .cse2) 256)))) (let ((.cse4 (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (= .cse0 (mod (+ .cse1 .cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse3)) 256))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse2) 256) 127) (<= 128 (mod .cse4 256)) (not (= .cse2 0)) (<= (mod (+ .cse4 .cse5) 256) 127) (= .cse6 (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))) .cse8 .cse9) (and .cse10 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse13 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256)))) (let ((.cse11 (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse11 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse12 0)) (<= (mod (+ .cse1 .cse12) 256) 127) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse11) 256) 127) (= (mod (+ .cse5 .cse11) 256) .cse6) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse13) 256))))))) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse16 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse15) 256)))) (and (<= 128 (mod (+ .cse1 .cse15) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse16) 256)))))) .cse17 .cse18 .cse19) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse20 (mod .cse22 256))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse20) 256)) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= (mod (+ .cse1 .cse22) 256) 127) (not (= .cse20 0)) (<= 128 (mod (+ .cse21 .cse5) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse21) 256) 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse25 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse24 (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse1 .cse23) 256)) (not (= .cse24 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256) 127) (= (mod (+ .cse5 .cse24) 256) .cse6) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse25) 256))))))) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse27 (mod .cse26 256))) (let ((.cse28 (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse1 .cse26) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse27) 256)) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ .cse28 .cse5) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse28) 256) 127)))))) (and .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse29 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse30) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse30 0)) (<= (mod (+ .cse1 .cse30) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse29) 256)))))))) .cse31 .cse32) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse34 (+ (- 256) (mod (+ .cse1 .cse33) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse33) 256) 127) (= (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse33 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse34) 256)))))))) .cse17 .cse18 .cse19) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7) 256))) (let ((.cse35 (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse35 .cse5) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse35 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse36 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse36) 256)))) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse37 (+ (- 256) (mod (+ .cse1 .cse38) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse38 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse38) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse37) 256)))))))) .cse17 .cse18 .cse19) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse41 (+ (- 256) (mod (+ .cse1 .cse40) 256)))) (let ((.cse39 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse39 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (not (= .cse40 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse40) 256)) (= (mod (+ .cse39 .cse5) 256) .cse6) (not (= .cse39 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse41) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse44 (+ (- 256) (mod (+ .cse1 .cse43) 256)))) (let ((.cse42 (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse42 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse43) 256) 127) (not (= .cse43 0)) (= (mod (+ .cse42 .cse5) 256) .cse6) (not (= .cse42 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse44) 256)))))))))) .cse9))) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse47 (+ (- 256) (mod (+ .cse1 .cse46) 256)))) (let ((.cse45 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= (mod .cse45 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256) 127) (not (= .cse46 0)) (= (mod (+ .cse45 .cse5) 256) .cse6) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse47) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse50 (+ (- 256) (mod (+ .cse1 .cse49) 256)))) (let ((.cse48 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= (mod .cse48 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse49 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse49) 256)) (= (mod (+ .cse48 .cse5) 256) .cse6) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) 256)))))))))) .cse9) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse53 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)))) (let ((.cse51 (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse51 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse51) 256)) (not (= .cse52 0)) (<= (mod (+ .cse1 .cse52) 256) 127) (= (mod (+ .cse5 .cse51) 256) .cse6) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse53) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse56 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse54) 256)))) (let ((.cse55 (mod .cse56 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse1 .cse54) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse55) 256)) (= (mod (+ .cse5 .cse55) 256) .cse6) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse56) 256)))))))) .cse31 .cse32)) .cse10) (and (let ((.cse61 (<= .cse74 127))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse59 (+ (- 256) (mod (+ .cse1 .cse58) 256)))) (let ((.cse57 (mod .cse59 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse57 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse58) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse0 (mod (+ .cse1 .cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse59)) 256)))) (not (= .cse58 0)) (<= (mod (+ .cse57 .cse5) 256) 127) (= .cse6 (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse57 0))))))) (and .cse60 .cse61 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse63 (+ (- 256) (mod (+ .cse1 .cse62) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse62) 256) 127) (= (mod .cse63 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse62 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse63))) (and (not (= .cse64 0)) (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse0 (mod (+ .cse1 .cse62 .cse64) 256))))))))) .cse17)) .cse8) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse67 (mod .cse66 256))) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse67))) (and (not (= .cse65 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (= (mod (+ .cse65 (* 255 .cse66)) 256) .cse0) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= (mod (mod .cse67 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse67 0))))))) .cse8) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse70 (+ (- 256) (mod (+ .cse1 .cse69) 256)))) (let ((.cse68 (mod .cse70 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse68 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse0 (mod (+ .cse1 .cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse70)) 256)))) (not (= .cse69 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse69) 256)) (<= (mod (+ .cse68 .cse5) 256) 127) (= .cse6 (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse68 0))))))) (and .cse60 .cse61 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse71 (+ (- 256) (mod (+ .cse1 .cse72) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse71 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse72 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse71))) (and (not (= .cse73 0)) (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse0 (mod (+ .cse1 .cse72 .cse73) 256))))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse72) 256)))))) .cse17)) .cse8))) .cse9) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse77 (+ (- 256) (mod (+ .cse1 .cse76) 256)))) (let ((.cse75 (mod .cse77 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse75 256) 127) (<= 128 (mod (+ .cse75 .cse5) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse0 (mod (+ .cse1 .cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse77)) 256)))) (not (= .cse76 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse76) 256)) (= .cse6 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse79 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse80 (+ (- 256) (mod (+ .cse1 .cse79) 256)))) (let ((.cse78 (mod .cse80 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse78 256) 127) (<= 128 (mod (+ .cse78 .cse5) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse79) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse0 (mod (+ .cse1 .cse79 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse80)) 256)))) (not (= .cse79 0)) (= .cse6 (mod (+ .cse78 |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))) .cse9) (and .cse60 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse81) 256) 127) (= (mod (+ (- 256) (mod (+ .cse1 .cse81) 256)) |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) .cse17 .cse18 .cse9)) .cse8)))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0)) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse84 (+ (- 256) (mod (+ .cse1 .cse85) 256)))) (let ((.cse83 (mod .cse84 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse5 .cse83) 256) .cse6) (not (= .cse83 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse84) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse85) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse83) 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|))) (and .cse17 .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse87 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse86 (+ (- 256) (mod (+ .cse1 .cse87) 256)))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse86) 256)) (= (mod .cse86 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse87) 256)))))) .cse19)) .cse10) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse88 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse90 (+ (- 256) (mod (+ .cse1 .cse88) 256)))) (let ((.cse89 (mod .cse90 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse88) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse5 .cse89) 256) .cse6) (not (= .cse89 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse90) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse89) 256) 127) (not (= .cse88 0))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse91 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse92 (+ (- 256) (mod (+ .cse1 .cse91) 256)))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse91) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse92) 256)) (= (mod .cse92 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse91 0)))))) .cse17 .cse18 .cse19)) .cse10) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse95 (+ (- 256) (mod (+ .cse1 .cse93) 256)))) (let ((.cse94 (mod .cse95 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse93) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse5 .cse94) 256) .cse6) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse95) 256)) (not (= .cse93 0)) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse94) 256))))))) .cse10) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse97 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse96 (mod .cse97 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse96) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse97) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse96 |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse98 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse99 (mod .cse98 256))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse98) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse99) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse99 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse99 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))))) .cse10) (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse102 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse101 (+ (- 256) (mod (+ .cse1 .cse102) 256)))) (let ((.cse100 (mod .cse101 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse5 .cse100) 256) .cse6) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse101) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse102) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse100) 256)))))))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-12-02 17:47:39,085 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0) (let ((.cse2 (mod .cse5 256))) (let ((.cse19 (+ .cse2 (- 256))) (.cse27 (<= 128 .cse2))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse3 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256)))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse3))) (let ((.cse0 (mod .cse1 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse0) (<= 128 (mod (* .cse1 255) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse3 .cse0) 0) (not (= .cse4 0)) (<= (mod (+ .cse5 .cse4) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse8 (mod .cse6 256))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse8) 256))) (and (<= 128 (mod (+ .cse5 .cse6) 256)) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse7 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse7) (= 0 (mod (mod .cse8 .cse7) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse12 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256)))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse12))) (let ((.cse9 (mod .cse10 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse9) (<= 128 (mod (* .cse10 255) 256)) (<= 128 (mod (+ .cse5 .cse11) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse12 .cse9) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse15 (mod .cse14 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse15) 256))) (and (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse13 0)) (<= (mod (+ .cse5 .cse14) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (= 0 (mod (mod .cse15 .cse13) 256)) (not (= .cse15 0)))))))) (not (= .cse2 0)) (<= .cse2 127)) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse18 (+ (- 256) (mod (+ .cse5 .cse17) 256)))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse18) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse16) (not (= .cse17 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256)) (not (= .cse16 0)) (= (mod .cse18 .cse16) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse23))) (let ((.cse20 (mod .cse22 256))) (let ((.cse21 (mod .cse23 .cse20))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse20) (= (mod .cse21 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ (* .cse22 255) .cse21) 256)) (not (= .cse23 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse26 (+ (- 256) (mod (+ .cse5 .cse24) 256)))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse26) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse25) (not (= .cse24 0)) (not (= .cse25 0)) (= (mod .cse26 .cse25) 0))))))) .cse27) (and (let ((.cse30 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse28 (+ (- 256) (mod (+ .cse5 .cse32) 256)))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse28))) (let ((.cse29 (mod (+ .cse5 .cse32 .cse31) 256))) (and (= (mod .cse28 (+ (- 256) .cse29)) 0) (<= .cse30 .cse29) (not (= .cse31 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse32 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256)) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse33 (+ (- 256) (mod (+ .cse5 .cse36) 256)))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse33))) (let ((.cse34 (mod (+ .cse5 .cse36 .cse35) 256))) (and (= (mod .cse33 (+ (- 256) .cse34)) 0) (<= .cse30 .cse34) (not (= .cse35 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse36) 256) 127) (not (= .cse36 0)) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse39 (mod .cse40 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse39))) (let ((.cse38 (mod (+ .cse37 (* 255 .cse40)) 256))) (and (not (= .cse37 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= .cse30 .cse38) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (not (= .cse39 0)) (= (mod (mod .cse39 (+ .cse38 (- 256))) 256) 0))))))))) .cse27))))) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (+ (- 256) (mod (+ .cse5 .cse43) 256)))) (let ((.cse42 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse41) 256))) (and (= (mod .cse41 .cse42) 0) (not (= .cse42 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse42) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse43) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse43 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod .cse46 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse45) 256))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (not (= .cse44 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod (mod .cse45 .cse44) 256) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse44)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse49 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse49) 256))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse47) 256) 127) (not (= .cse48 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod (mod .cse49 .cse48) 256) 0) (not (= .cse49 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse48)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (+ (- 256) (mod (+ .cse5 .cse52) 256)))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) 256))) (and (= (mod .cse50 .cse51) 0) (not (= .cse51 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse51) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|))))) is different from false [2023-12-02 17:47:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 17:47:41,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:48,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2023-12-02 17:47:48,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188243585] [2023-12-02 17:47:48,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 17:47:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703201827] [2023-12-02 17:47:48,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. [2023-12-02 17:47:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [508407943] [2023-12-02 17:47:48,430 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 17:47:48,430 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:47:48,430 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:47:48,430 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:47:48,431 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:47:48,434 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:332) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:223) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2023-12-02 17:47:48,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2023-12-02 17:47:48,436 ERROR L171 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2023-12-02 17:47:48,437 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2023-12-02 17:47:48,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-02 17:47:48,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 17:47:48,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 17:47:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-02 17:47:48,647 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-02 17:47:48,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 17:47:48,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:47:48 BoogieIcfgContainer [2023-12-02 17:47:48,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 17:47:48,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 17:47:48,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 17:47:48,665 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 17:47:48,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:44:14" (3/4) ... [2023-12-02 17:47:48,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 17:47:48,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 17:47:48,669 INFO L158 Benchmark]: Toolchain (without parser) took 214939.81ms. Allocated memory was 142.6MB in the beginning and 316.7MB in the end (delta: 174.1MB). Free memory was 99.8MB in the beginning and 140.4MB in the end (delta: -40.6MB). Peak memory consumption was 135.3MB. Max. memory is 16.1GB. [2023-12-02 17:47:48,670 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:47:48,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.73ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 87.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 17:47:48,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.49ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:47:48,671 INFO L158 Benchmark]: Boogie Preprocessor took 25.89ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:47:48,671 INFO L158 Benchmark]: RCFGBuilder took 392.11ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 107.5MB in the end (delta: -22.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-12-02 17:47:48,672 INFO L158 Benchmark]: TraceAbstraction took 214243.89ms. Allocated memory was 142.6MB in the beginning and 316.7MB in the end (delta: 174.1MB). Free memory was 107.1MB in the beginning and 140.4MB in the end (delta: -33.3MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2023-12-02 17:47:48,672 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 316.7MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:47:48,675 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.17ms. Allocated memory is still 111.1MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.73ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 87.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.49ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.89ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 392.11ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 107.5MB in the end (delta: -22.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 214243.89ms. Allocated memory was 142.6MB in the beginning and 316.7MB in the end (delta: 174.1MB). Free memory was 107.1MB in the beginning and 140.4MB in the end (delta: -33.3MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 316.7MB. Free memory is still 140.4MB. 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: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L108] COND TRUE __VERIFIER_nondet_int() [L109] CALL main1() [L49] signed char x = __VERIFIER_nondet_char(); [L50] signed char y = __VERIFIER_nondet_char(); [L51] signed char g; [L53] CALL, EXPR gcd_test(x, y) [L33] signed char t; [L35] COND TRUE a < (signed char)0 [L35] a = -a [L36] COND FALSE !(b < (signed char)0) [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND FALSE !(b != (signed char)0) [L43] return a; [L53] RET, EXPR gcd_test(x, y) [L53] g = gcd_test(x, y) [L55] COND TRUE y > (signed char)0 [L56] CALL __VERIFIER_assert(y >= g) [L26] COND TRUE !(cond) [L27] reach_error() - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 214.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 42 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 211.2s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 25 ConstructedInterpolants, 4 QuantifiedInterpolants, 6726 SizeOfPredicates, 14 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/8 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 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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_5b5141f9-fbae-4741-9529-a0284bea6c36/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 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:47:50,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:47:50,421 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:47:50,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:47:50,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:47:50,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:47:50,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:47:50,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:47:50,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:47:50,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:47:50,458 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:47:50,459 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:47:50,460 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:47:50,460 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:47:50,461 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:47:50,461 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:47:50,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:47:50,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:47:50,463 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:47:50,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:47:50,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:47:50,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:47:50,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:47:50,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:47:50,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:47:50,467 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:47:50,467 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:47:50,467 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:47:50,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:47:50,468 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:47:50,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:47:50,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:47:50,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:47:50,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:47:50,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:47:50,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:47:50,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:47:50,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:47:50,471 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:47:50,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:47:50,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:47:50,472 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:47:50,472 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:47:50,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:47:50,472 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_5b5141f9-fbae-4741-9529-a0284bea6c36/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_5b5141f9-fbae-4741-9529-a0284bea6c36/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 -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2023-12-02 17:47:50,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:47:50,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:47:50,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:47:50,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:47:50,773 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:47:50,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-12-02 17:47:53,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:47:53,777 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:47:53,778 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-12-02 17:47:53,787 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data/bc627a0c1/9e50446798704cc4885924b1a494d395/FLAGf62048c05 [2023-12-02 17:47:53,802 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/data/bc627a0c1/9e50446798704cc4885924b1a494d395 [2023-12-02 17:47:53,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:47:53,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:47:53,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:47:53,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:47:53,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:47:53,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:47:53" (1/1) ... [2023-12-02 17:47:53,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693e7865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:53, skipping insertion in model container [2023-12-02 17:47:53,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:47:53" (1/1) ... [2023-12-02 17:47:53,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:47:53,995 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-12-02 17:47:54,021 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-12-02 17:47:54,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:47:54,037 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:47:54,052 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-12-02 17:47:54,064 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_5b5141f9-fbae-4741-9529-a0284bea6c36/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-12-02 17:47:54,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:47:54,083 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:47:54,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54 WrapperNode [2023-12-02 17:47:54,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:47:54,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:47:54,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:47:54,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:47:54,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,136 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-12-02 17:47:54,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:47:54,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:47:54,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:47:54,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:47:54,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:47:54,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:47:54,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:47:54,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:47:54,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (1/1) ... [2023-12-02 17:47:54,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:47:54,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:47:54,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:47:54,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:47:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:47:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:47:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-02 17:47:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-02 17:47:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-02 17:47:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-02 17:47:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:47:54,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:47:54,335 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:47:54,337 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:48:03,337 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:48:03,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:48:03,361 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:48:03,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:48:03 BoogieIcfgContainer [2023-12-02 17:48:03,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:48:03,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:48:03,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:48:03,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:48:03,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:47:53" (1/3) ... [2023-12-02 17:48:03,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df40930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:48:03, skipping insertion in model container [2023-12-02 17:48:03,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:54" (2/3) ... [2023-12-02 17:48:03,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df40930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:48:03, skipping insertion in model container [2023-12-02 17:48:03,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:48:03" (3/3) ... [2023-12-02 17:48:03,371 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2023-12-02 17:48:03,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:48:03,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 17:48:03,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:48:03,440 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;@2bb1a882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:48:03,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 17:48:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:48:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:48:03,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:48:03,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:48:03,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:48:03,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:48:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-12-02 17:48:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:48:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079596960] [2023-12-02 17:48:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:03,464 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 17:48:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:48:03,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:03,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:03,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:48:03,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:03,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:48:03,668 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:48:03,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079596960] [2023-12-02 17:48:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079596960] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:48:03,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:48:03,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:48:03,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634159266] [2023-12-02 17:48:03,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:48:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:48:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:48:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:48:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:48:03,711 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:07,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:09,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:48:12,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:14,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:48:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:48:14,775 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2023-12-02 17:48:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:48:14,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 17:48:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:48:14,783 INFO L225 Difference]: With dead ends: 61 [2023-12-02 17:48:14,783 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 17:48:14,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:48:14,789 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:48:14,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2023-12-02 17:48:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 17:48:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-02 17:48:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:48:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-02 17:48:14,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2023-12-02 17:48:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:48:14,822 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-02 17:48:14,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-02 17:48:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:48:14,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:48:14,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:48:14,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:15,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:15,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:48:15,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:48:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-12-02 17:48:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:48:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568488951] [2023-12-02 17:48:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:15,026 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 17:48:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:48:15,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:15,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:15,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:48:15,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:15,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:48:15,257 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:48:15,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568488951] [2023-12-02 17:48:15,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568488951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:48:15,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:48:15,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:48:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942086024] [2023-12-02 17:48:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:48:15,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:48:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:48:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:48:15,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:48:15,260 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:18,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:20,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:22,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:25,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:27,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:29,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:48:29,857 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-12-02 17:48:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:48:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 17:48:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:48:30,069 INFO L225 Difference]: With dead ends: 35 [2023-12-02 17:48:30,069 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 17:48:30,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:48:30,071 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:48:30,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 6 Unknown, 0 Unchecked, 14.5s Time] [2023-12-02 17:48:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 17:48:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-12-02 17:48:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:48:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-02 17:48:30,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2023-12-02 17:48:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:48:30,077 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-02 17:48:30,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-02 17:48:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 17:48:30,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:48:30,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:48:30,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:30,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:30,278 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:48:30,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:48:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2066108861, now seen corresponding path program 1 times [2023-12-02 17:48:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:48:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228251959] [2023-12-02 17:48:30,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:30,280 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 17:48:30,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:48:30,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:30,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:30,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:48:30,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:48:30,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:48:30,523 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:48:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228251959] [2023-12-02 17:48:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228251959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:48:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:48:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:48:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112883095] [2023-12-02 17:48:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:48:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:48:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:48:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:48:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:48:30,525 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:33,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:35,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:37,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:40,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:42,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:44,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:48:44,987 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-12-02 17:48:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:48:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 17:48:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:48:45,209 INFO L225 Difference]: With dead ends: 36 [2023-12-02 17:48:45,209 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 17:48:45,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:48:45,210 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:48:45,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 14.5s Time] [2023-12-02 17:48:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 17:48:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-02 17:48:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:48:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-02 17:48:45,218 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2023-12-02 17:48:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:48:45,218 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-02 17:48:45,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-02 17:48:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 17:48:45,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:48:45,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:48:45,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:45,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:45,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:48:45,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:48:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-12-02 17:48:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:48:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094267943] [2023-12-02 17:48:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:45,421 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 17:48:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:48:45,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:45,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:48:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:45,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:48:45,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:46,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:48:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:46,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:48:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094267943] [2023-12-02 17:48:46,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094267943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:48:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753676219] [2023-12-02 17:48:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:46,936 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:48:46,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:48:46,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:48:46,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-02 17:48:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:47,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:48:47,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:47,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:48:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1753676219] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:48:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235296354] [2023-12-02 17:48:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:47,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:48:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:48:47,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:48:47,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:48:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:47,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:48:47,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:47,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:48:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:48:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235296354] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:48:48,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 17:48:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 6] total 15 [2023-12-02 17:48:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973712505] [2023-12-02 17:48:48,663 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 17:48:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 17:48:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:48:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 17:48:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:48:48,665 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:48:53,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:55,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:57,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:48:59,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:01,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:03,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:05,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:07,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:09,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:11,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:13,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:15,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:17,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:19,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:24,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:26,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:28,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:30,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:32,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:34,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:36,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:38,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:42,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:44,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:46,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:48,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:49:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:49:48,581 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-12-02 17:49:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:49:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 17:49:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:49:48,583 INFO L225 Difference]: With dead ends: 38 [2023-12-02 17:49:48,583 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 17:49:48,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:49:48,584 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:49:48,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 190 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 59.0s Time] [2023-12-02 17:49:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 17:49:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-02 17:49:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:49:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-02 17:49:48,590 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 10 [2023-12-02 17:49:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:49:48,590 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-02 17:49:48,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:49:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-02 17:49:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:49:48,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:49:48,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:49:48,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:49:48,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:49:48,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-02 17:49:49,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:49:49,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:49:49,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:49:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1757426221, now seen corresponding path program 1 times [2023-12-02 17:49:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:49:49,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014946155] [2023-12-02 17:49:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:49:49,195 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 17:49:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:49:49,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 17:49:49,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5141f9-fbae-4741-9529-a0284bea6c36/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 (8)] Waiting until timeout for monitored process