./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_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_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/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 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:41:25,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:41:25,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:41:25,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:41:25,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:41:25,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:41:25,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:41:25,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:41:25,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:41:25,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:41:25,704 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:41:25,705 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:41:25,705 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:41:25,717 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:41:25,717 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:41:25,718 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:41:25,718 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:41:25,719 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:41:25,719 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:41:25,720 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:41:25,721 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:41:25,721 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:41:25,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:41:25,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:41:25,723 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:41:25,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:41:25,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:41:25,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:41:25,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:41:25,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:41:25,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:41:25,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:41:25,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:41:25,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:41:25,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:41:25,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:41:25,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:41:25,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:41:25,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:41:25,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:41:25,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:41:25,729 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:41:25,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:41:25,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:41:25,729 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:41:25,729 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:41:25,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:41:25,730 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_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/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 -> 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 [2023-12-02 17:41:25,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:41:25,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:41:25,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:41:25,993 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:41:25,993 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:41:25,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2023-12-02 17:41:28,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:41:28,922 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:41:28,923 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2023-12-02 17:41:28,930 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data/a5cb709f9/ca9debee6b594750bbab1d5d1272169d/FLAG1f8d2d135 [2023-12-02 17:41:28,942 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data/a5cb709f9/ca9debee6b594750bbab1d5d1272169d [2023-12-02 17:41:28,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:41:28,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:41:28,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:41:28,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:41:28,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:41:28,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:41:28" (1/1) ... [2023-12-02 17:41:28,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3411e029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:28, skipping insertion in model container [2023-12-02 17:41:28,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:41:28" (1/1) ... [2023-12-02 17:41:28,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:41:29,138 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2023-12-02 17:41:29,163 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2023-12-02 17:41:29,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:41:29,175 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:41:29,189 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2023-12-02 17:41:29,199 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2023-12-02 17:41:29,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:41:29,215 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:41:29,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29 WrapperNode [2023-12-02 17:41:29,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:41:29,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:41:29,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:41:29,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:41:29,224 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:41:29" (1/1) ... [2023-12-02 17:41:29,231 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:41:29" (1/1) ... [2023-12-02 17:41:29,248 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-12-02 17:41:29,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:41:29,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:41:29,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:41:29,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:41:29,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:41:29,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:41:29,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:41:29,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:41:29,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (1/1) ... [2023-12-02 17:41:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:41:29,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:29,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:41:29,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:41:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:41:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-02 17:41:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-02 17:41:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-02 17:41:29,327 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-02 17:41:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:41:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:41:29,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:41:29,392 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:41:29,394 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:41:29,539 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:41:29,609 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:41:29,609 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:41:29,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:29 BoogieIcfgContainer [2023-12-02 17:41:29,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:41:29,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:41:29,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:41:29,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:41:29,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:41:28" (1/3) ... [2023-12-02 17:41:29,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8a87ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:41:29, skipping insertion in model container [2023-12-02 17:41:29,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:29" (2/3) ... [2023-12-02 17:41:29,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8a87ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:41:29, skipping insertion in model container [2023-12-02 17:41:29,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:29" (3/3) ... [2023-12-02 17:41:29,619 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_1.i [2023-12-02 17:41:29,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:41:29,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 17:41:29,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:41:29,682 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;@3c6ec4b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:41:29,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 17:41:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:41:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 17:41:29,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:29,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 17:41:29,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:41:29,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash -584909265, now seen corresponding path program 1 times [2023-12-02 17:41:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:41:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683245816] [2023-12-02 17:41:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:41:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:30,070 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:41:30,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:41:30,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683245816] [2023-12-02 17:41:30,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683245816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:41:30,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:41:30,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:41:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821992168] [2023-12-02 17:41:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:41:30,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:41:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:41:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:41:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:41:30,118 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:41:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:30,210 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-02 17:41:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:41:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:41:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:30,219 INFO L225 Difference]: With dead ends: 37 [2023-12-02 17:41:30,219 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 17:41:30,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:41:30,224 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:30,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:41:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 17:41:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 17:41:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:41:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-02 17:41:30,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2023-12-02 17:41:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:30,258 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-02 17:41:30,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:41:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-02 17:41:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:41:30,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:30,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:30,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:41:30,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:41:30,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1018725074, now seen corresponding path program 1 times [2023-12-02 17:41:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:41:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755788396] [2023-12-02 17:41:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:41:30,276 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 17:41:30,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255125849] [2023-12-02 17:41:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:30,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:30,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:41:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:30,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 17:41:30,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:35,532 WARN L876 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (let ((.cse0 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 128 .cse0) (let ((.cse1 (+ .cse0 (- 256)))) (or (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= 0 (mod .cse1 |ULTIMATE.start_gcd_test_#res#1|)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (<= 0 |ULTIMATE.start_gcd_test_#res#1|) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))) (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= (+ |ULTIMATE.start_gcd_test_#res#1| 1) 0) (= 0 (mod .cse1 |ULTIMATE.start_gcd_test_#res#1|))))))) (and (<= .cse0 127) (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= (mod (mod .cse0 |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (not (= |ULTIMATE.start_gcd_test_#res#1| 0))))))) (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) is different from true [2023-12-02 17:41:35,734 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:41:35,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:39,868 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:41:39,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:41:39,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755788396] [2023-12-02 17:41:39,869 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 17:41:39,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255125849] [2023-12-02 17:41:39,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255125849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:39,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931823513] [2023-12-02 17:41:39,886 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 17:41:39,886 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:41:39,889 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:41:39,893 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:41:39,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:41:40,482 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:41:41,954 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '155#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 1 |ULTIMATE.start_main1_~x~0#1|) (<= (+ |ULTIMATE.start_main1_~x~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= |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) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)))' at error location [2023-12-02 17:41:41,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:41:41,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:41:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-02 17:41:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436235439] [2023-12-02 17:41:41,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:41:41,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 17:41:41,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:41:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 17:41:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=150, Unknown=2, NotChecked=24, Total=210 [2023-12-02 17:41:41,957 INFO L87 Difference]: Start difference. First operand 21 states and 23 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:41:43,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-02 17:41:45,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-02 17:41:47,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-02 17:41:49,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-02 17:41:52,424 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< |c_ULTIMATE.start_main1_~g~0#1| .cse0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (or (and (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (let ((.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 128 .cse1) (let ((.cse2 (+ .cse1 (- 256)))) (or (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= 0 (mod .cse2 |ULTIMATE.start_gcd_test_#res#1|)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (<= 0 |ULTIMATE.start_gcd_test_#res#1|) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))) (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= (+ |ULTIMATE.start_gcd_test_#res#1| 1) 0) (= 0 (mod .cse2 |ULTIMATE.start_gcd_test_#res#1|))))))) (and (<= .cse1 127) (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= (mod (mod .cse1 |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (not (= |ULTIMATE.start_gcd_test_#res#1| 0))))))) (<= .cse0 0))))) is different from true [2023-12-02 17:41:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:58,883 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-12-02 17:41:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 17:41:58,883 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:41:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:58,884 INFO L225 Difference]: With dead ends: 30 [2023-12-02 17:41:58,884 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 17:41:58,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=5, NotChecked=58, Total=306 [2023-12-02 17:41:58,886 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:58,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 3 Unknown, 36 Unchecked, 9.8s Time] [2023-12-02 17:41:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 17:41:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-02 17:41:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:41:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-12-02 17:41:58,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 7 [2023-12-02 17:41:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:58,892 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-12-02 17:41:58,893 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:41:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-12-02 17:41:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 17:41:58,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:58,894 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:58,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:41:59,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:59,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:41:59,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2117450257, now seen corresponding path program 2 times [2023-12-02 17:41:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:41:59,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382353744] [2023-12-02 17:41:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:41:59,105 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 17:41:59,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805356545] [2023-12-02 17:41:59,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:41:59,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:59,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:59,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:59,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:41:59,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:41:59,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:41:59,361 WARN L260 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 17:41:59,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:42:15,683 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse7 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse12 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse5 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse1 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse8 (<= 128 .cse7)) (.cse9 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse11 (+ .cse7 (- 256))) (.cse3 (<= .cse7 127)) (.cse2 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_32| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse1) (and .cse2 .cse3 .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse4 .cse5) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse4 0)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse4) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))) (and .cse2 (or (and .cse3 .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_32| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse10 (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_32| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= .cse9 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (not (= .cse10 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse12))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse13 .cse5) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse13) 256)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse0 .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse14 .cse5) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse14 0)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse14) 256) 127) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse0 .cse1) (and .cse2 (or (and .cse8 .cse12 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse15 .cse5) 256) 127) (not (= .cse15 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256) .cse6) (= .cse9 (mod (+ (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_32|) |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))) (and .cse8 .cse12 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse17 (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse16) 256) .cse6) (<= 128 (mod (+ .cse16 .cse5) 256)) (not (= .cse17 0)) (= .cse9 (mod (+ .cse17 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))) (and .cse3 .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse18 .cse5) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse18) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))))) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse1) (and (or (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse19 (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse19 0)) (= .cse9 (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))) .cse2)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-12-02 17:42:44,126 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse11 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse1 (<= .cse6 127)) (.cse21 (<= 128 .cse6)) (.cse48 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse18 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse20 (+ .cse6 (- 256))) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse2 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse4 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse5 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse5))) (and (= .cse2 (mod (+ .cse3 (* 255 .cse4)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 (mod (+ .cse3 .cse4) 256)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse10 (mod .cse8 256))) (let ((.cse9 (mod .cse10 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse10))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse7 (* 255 .cse8)) 256)) (= (mod .cse9 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse9) 256)) (not (= .cse7 0)) (<= (mod (+ .cse7 .cse8) 256) 127)))))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse14))) (and (<= 128 (mod (+ .cse12 .cse13) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse12 (* 255 .cse13)) 256)) (not (= .cse14 0)) (= (mod (mod .cse14 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))))) .cse11) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse16 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse19 (+ (- 256) (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse19)) (.cse15 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse15 0)) (<= 128 (mod (+ (* 255 .cse16) .cse17 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)) (= .cse2 (mod (+ .cse16 .cse17 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (= .cse18 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256))))))) .cse21) (and .cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse22 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse25 (+ (- 256) (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse25)) (.cse24 (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (mod (+ (* 255 .cse22) .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse24 0)) (= .cse2 (mod (+ .cse22 .cse23 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (= .cse18 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256)))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse27 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse29 (mod .cse27 256))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse29)) (.cse28 (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse2 (mod (+ .cse26 (* 255 .cse27)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse26 .cse27) 256) 127) (not (= .cse26 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256)) (<= 128 (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))) .cse0 .cse1) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse31 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse32 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse32))) (and (= .cse2 (mod (+ .cse30 (* 255 .cse31)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse30 .cse31) 256) 127) (not (= .cse30 0)) (= (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse34 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse35 (mod .cse34 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse35))) (and (<= 128 (mod (+ .cse33 .cse34) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse33 (* 255 .cse34)) 256)) (not (= .cse35 0)) (= (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse37 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse38))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse36 (* 255 .cse37)) 256)) (not (= .cse36 0)) (<= (mod (+ .cse36 .cse37) 256) 127) (= (mod .cse38 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse11) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse40 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse41 (mod .cse40 256))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse41))) (and (= .cse2 (mod (+ .cse39 (* 255 .cse40)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse41 0)) (<= 128 (mod (+ .cse39 .cse40) 256)) (= (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse43 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse44 (+ (- 256) (mod (+ .cse43 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse44))) (and (not (= .cse42 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (mod (+ (* 255 .cse43) .cse42 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse2 (mod (+ .cse43 .cse42 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))))))) .cse21) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse45 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse47 (+ (- 256) (mod (+ .cse45 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse47))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ (* 255 .cse45) .cse46 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)) (= (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse2 (mod (+ .cse45 .cse46 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (not (= .cse45 0))))))) .cse21)))) (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) .cse48)))) (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse49 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (not (= .cse49 0)) (= (mod (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse49) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) .cse11) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse50 (mod (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse50) 256)) (not (= .cse50 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) .cse1) (and .cse21 (let ((.cse52 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse51 (+ (- 256) (mod (+ (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse51) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= (mod .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) .cse48 (<= 128 (mod .cse52 256))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse53 (+ (- 256) (mod (+ (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)))) (let ((.cse54 (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse53) 256)) (not (= .cse54 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= .cse18 (mod (+ .cse52 .cse54) 256)))))))))) .cse0))))))) is different from false [2023-12-02 17:42:46,165 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse11 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse1 (<= .cse6 127)) (.cse21 (<= 128 .cse6)) (.cse48 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse18 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse20 (+ .cse6 (- 256))) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse2 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse4 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse5 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse5))) (and (= .cse2 (mod (+ .cse3 (* 255 .cse4)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 (mod (+ .cse3 .cse4) 256)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse10 (mod .cse8 256))) (let ((.cse9 (mod .cse10 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse10))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse7 (* 255 .cse8)) 256)) (= (mod .cse9 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse9) 256)) (not (= .cse7 0)) (<= (mod (+ .cse7 .cse8) 256) 127)))))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse14))) (and (<= 128 (mod (+ .cse12 .cse13) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse12 (* 255 .cse13)) 256)) (not (= .cse14 0)) (= (mod (mod .cse14 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))))) .cse11) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse16 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse19 (+ (- 256) (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse19)) (.cse15 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse15 0)) (<= 128 (mod (+ (* 255 .cse16) .cse17 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)) (= .cse2 (mod (+ .cse16 .cse17 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (= .cse18 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256))))))) .cse21) (and .cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse22 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse25 (+ (- 256) (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse25)) (.cse24 (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (mod (+ (* 255 .cse22) .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse24 0)) (= .cse2 (mod (+ .cse22 .cse23 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (= .cse18 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256)))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse27 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse29 (mod .cse27 256))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse29)) (.cse28 (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse2 (mod (+ .cse26 (* 255 .cse27)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse26 .cse27) 256) 127) (not (= .cse26 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256)) (<= 128 (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))) .cse0 .cse1) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse31 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse32 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse32))) (and (= .cse2 (mod (+ .cse30 (* 255 .cse31)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse30 .cse31) 256) 127) (not (= .cse30 0)) (= (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse34 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse35 (mod .cse34 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse35))) (and (<= 128 (mod (+ .cse33 .cse34) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse33 (* 255 .cse34)) 256)) (not (= .cse35 0)) (= (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse37 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse38))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse2 (mod (+ .cse36 (* 255 .cse37)) 256)) (not (= .cse36 0)) (<= (mod (+ .cse36 .cse37) 256) 127) (= (mod .cse38 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse11) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse40 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse41 (mod .cse40 256))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse41))) (and (= .cse2 (mod (+ .cse39 (* 255 .cse40)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse41 0)) (<= 128 (mod (+ .cse39 .cse40) 256)) (= (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse43 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse44 (+ (- 256) (mod (+ .cse43 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse44))) (and (not (= .cse42 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (mod (+ (* 255 .cse43) .cse42 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse2 (mod (+ .cse43 .cse42 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))))))) .cse21) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse45 (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse47 (+ (- 256) (mod (+ .cse45 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse47))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ (* 255 .cse45) .cse46 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)) (= (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse2 (mod (+ .cse45 .cse46 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (not (= .cse45 0))))))) .cse21)))) (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) .cse48)))) (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse49 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (not (= .cse49 0)) (= (mod (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse49) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) .cse11) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse50 (mod (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse50) 256)) (not (= .cse50 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) .cse1) (and .cse21 (let ((.cse52 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse51 (+ (- 256) (mod (+ (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse51) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= (mod .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) .cse48 (<= 128 (mod .cse52 256))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse53 (+ (- 256) (mod (+ (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256)))) (let ((.cse54 (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse53) 256)) (not (= .cse54 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= .cse18 (mod (+ .cse52 .cse54) 256)))))))))) .cse0))))))) is different from true [2023-12-02 17:42:46,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2023-12-02 17:42:46,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:42:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382353744] [2023-12-02 17:42:46,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 17:42:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805356545] [2023-12-02 17:42:46,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:42:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393770663] [2023-12-02 17:42:46,848 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 17:42:46,848 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:42:46,849 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:42:46,849 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:42:46,849 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:42:46,853 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:42:46,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:42:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2023-12-02 17:42:46,854 ERROR L171 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2023-12-02 17:42:46,855 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2023-12-02 17:42:46,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-02 17:42:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 17:42:46,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 17:42:47,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:42:47,065 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-02 17:42:47,068 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 17:42:47,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:42:47 BoogieIcfgContainer [2023-12-02 17:42:47,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 17:42:47,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 17:42:47,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 17:42:47,084 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 17:42:47,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:29" (3/4) ... [2023-12-02 17:42:47,087 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 17:42:47,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 17:42:47,089 INFO L158 Benchmark]: Toolchain (without parser) took 78142.71ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 134.9MB in the beginning and 158.6MB in the end (delta: -23.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-12-02 17:42:47,089 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:42:47,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.39ms. Allocated memory is still 165.7MB. Free memory was 134.4MB in the beginning and 122.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 17:42:47,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.39ms. Allocated memory is still 165.7MB. Free memory was 122.9MB in the beginning and 121.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:42:47,090 INFO L158 Benchmark]: Boogie Preprocessor took 20.99ms. Allocated memory is still 165.7MB. Free memory was 121.3MB in the beginning and 119.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:42:47,091 INFO L158 Benchmark]: RCFGBuilder took 340.22ms. Allocated memory is still 165.7MB. Free memory was 119.7MB in the beginning and 104.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 17:42:47,091 INFO L158 Benchmark]: TraceAbstraction took 77469.77ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 103.6MB in the beginning and 159.6MB in the end (delta: -56.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:42:47,092 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 199.2MB. Free memory was 159.6MB in the beginning and 158.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:42:47,094 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.19ms. Allocated memory is still 121.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.39ms. Allocated memory is still 165.7MB. Free memory was 134.4MB in the beginning and 122.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.39ms. Allocated memory is still 165.7MB. Free memory was 122.9MB in the beginning and 121.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.99ms. Allocated memory is still 165.7MB. Free memory was 121.3MB in the beginning and 119.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.22ms. Allocated memory is still 165.7MB. Free memory was 119.7MB in the beginning and 104.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 77469.77ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 103.6MB in the beginning and 159.6MB in the end (delta: -56.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 199.2MB. Free memory was 159.6MB in the beginning and 158.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 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 x > (signed char)0 [L56] CALL __VERIFIER_assert(x >= 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, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 77.4s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 30 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 16, 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.3s SatisfiabilityAnalysisTime, 57.3s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 17 ConstructedInterpolants, 2 QuantifiedInterpolants, 501 SizeOfPredicates, 7 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 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_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/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 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:42:48,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:42:48,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:42:48,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:42:48,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:42:48,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:42:48,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:42:48,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:42:48,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:42:48,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:42:48,889 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:42:48,890 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:42:48,890 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:42:48,891 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:42:48,891 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:42:48,892 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:42:48,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:42:48,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:42:48,894 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:42:48,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:42:48,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:42:48,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:42:48,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:42:48,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:42:48,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:42:48,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:42:48,898 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:42:48,898 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:42:48,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:42:48,899 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:42:48,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:42:48,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:42:48,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:42:48,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:42:48,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:42:48,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:42:48,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:42:48,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:42:48,901 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:42:48,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:42:48,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:42:48,902 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:42:48,902 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:42:48,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:42:48,903 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_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/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 -> 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 [2023-12-02 17:42:49,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:42:49,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:42:49,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:42:49,195 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:42:49,196 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:42:49,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2023-12-02 17:42:52,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:42:52,205 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:42:52,205 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2023-12-02 17:42:52,213 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data/482f2e5d8/0cbde829b6da473c9e1fb8c5c9a306ec/FLAG95adbea14 [2023-12-02 17:42:52,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/data/482f2e5d8/0cbde829b6da473c9e1fb8c5c9a306ec [2023-12-02 17:42:52,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:42:52,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:42:52,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:42:52,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:42:52,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:42:52,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c59ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52, skipping insertion in model container [2023-12-02 17:42:52,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,260 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:42:52,395 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2023-12-02 17:42:52,421 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2023-12-02 17:42:52,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:42:52,437 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:42:52,450 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2023-12-02 17:42:52,463 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_28973475-4462-45d7-926a-fa1c9146573f/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2023-12-02 17:42:52,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:42:52,479 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:42:52,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52 WrapperNode [2023-12-02 17:42:52,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:42:52,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:42:52,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:42:52,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:42:52,487 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:42:52" (1/1) ... [2023-12-02 17:42:52,497 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:42:52" (1/1) ... [2023-12-02 17:42:52,520 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2023-12-02 17:42:52,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:42:52,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:42:52,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:42:52,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:42:52,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:42:52,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:42:52,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:42:52,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:42:52,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2023-12-02 17:42:52,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:42:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:42:52,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:42:52,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:42:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:42:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:42:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-02 17:42:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-02 17:42:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-02 17:42:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-02 17:42:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:42:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:42:52,696 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:42:52,698 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:43:01,749 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:43:01,783 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:43:01,784 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:43:01,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:43:01 BoogieIcfgContainer [2023-12-02 17:43:01,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:43:01,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:43:01,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:43:01,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:43:01,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:42:52" (1/3) ... [2023-12-02 17:43:01,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aab2808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:43:01, skipping insertion in model container [2023-12-02 17:43:01,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (2/3) ... [2023-12-02 17:43:01,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aab2808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:43:01, skipping insertion in model container [2023-12-02 17:43:01,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:43:01" (3/3) ... [2023-12-02 17:43:01,795 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_1.i [2023-12-02 17:43:01,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:43:01,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 17:43:01,871 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:43:01,877 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;@3071c535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:43:01,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 17:43:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:43:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:43:01,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:43:01,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:43:01,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:43:01,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:43:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-12-02 17:43:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:43:01,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166458977] [2023-12-02 17:43:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:43:01,903 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:43:01,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:43:01,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:01,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:43:01,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:43:01,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:43:02,135 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:43:02,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:43:02,136 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:43:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166458977] [2023-12-02 17:43:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166458977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:43:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:43:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:43:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723475509] [2023-12-02 17:43:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:43:02,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:43:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:43:02,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:43:02,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:43:02,174 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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:43:05,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:43:07,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s 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:43:10,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:43:12,901 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:43:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:43:13,294 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2023-12-02 17:43:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:43:13,297 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:43:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:43:13,303 INFO L225 Difference]: With dead ends: 55 [2023-12-02 17:43:13,304 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 17:43:13,306 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:43:13,310 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 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.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:43:13,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2023-12-02 17:43:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 17:43:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 17:43:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:43:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-02 17:43:13,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2023-12-02 17:43:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:43:13,343 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-02 17:43:13,344 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:43:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-02 17:43:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:43:13,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:43:13,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:43:13,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:13,546 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:43:13,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:43:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-12-02 17:43:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:43:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147827916] [2023-12-02 17:43:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:43:13,548 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:43:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:43:13,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:13,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:43:13,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:43:13,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:43:13,755 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:43:13,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:43:13,755 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:43:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147827916] [2023-12-02 17:43:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147827916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:43:13,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:43:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:43:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197413549] [2023-12-02 17:43:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:43:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:43:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:43:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:43:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:43:13,759 INFO L87 Difference]: Start difference. First operand 26 states and 30 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:43:17,107 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:43:19,112 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:43:21,121 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:43:24,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:43:26,374 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:43:28,381 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:43:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:43:28,384 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-12-02 17:43:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:43:28,621 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:43:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:43:28,622 INFO L225 Difference]: With dead ends: 36 [2023-12-02 17:43:28,622 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 17:43:28,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:43:28,624 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:43:28,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 14.6s Time] [2023-12-02 17:43:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 17:43:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-12-02 17:43:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:43:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-02 17:43:28,630 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-02 17:43:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:43:28,630 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-02 17:43:28,630 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:43:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-02 17:43:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:43:28,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:43:28,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:43:28,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:28,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:28,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:43:28,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:43:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1810252494, now seen corresponding path program 1 times [2023-12-02 17:43:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:43:28,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223389040] [2023-12-02 17:43:28,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:43:28,832 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:43:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:43:28,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:28,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:43:28,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:43:28,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:43:29,366 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:43:29,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:43:29,367 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:43:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223389040] [2023-12-02 17:43:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223389040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:43:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:43:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:43:29,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530396731] [2023-12-02 17:43:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:43:29,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:43:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:43:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:43:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:43:29,370 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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:43:32,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:43:34,934 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:43:36,937 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:43:38,943 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:43:40,949 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:43:44,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:43:46,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:43:48,360 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:43:50,366 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:43:52,372 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:43:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:43:52,375 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-12-02 17:43:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:43:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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:43:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:43:52,612 INFO L225 Difference]: With dead ends: 32 [2023-12-02 17:43:52,612 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 17:43:52,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:43:52,614 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:43:52,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 22.9s Time] [2023-12-02 17:43:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 17:43:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-02 17:43:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:43:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-02 17:43:52,621 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-02 17:43:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:43:52,621 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-02 17:43:52,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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:43:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-02 17:43:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 17:43:52,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:43:52,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:43:52,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:52,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:52,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:43:52,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:43:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1500069489, now seen corresponding path program 1 times [2023-12-02 17:43:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:43:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371264065] [2023-12-02 17:43:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:43:52,825 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:43:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:43:52,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:52,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:43:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:43:52,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 17:43:52,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:43:59,369 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:43:59,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:44:16,763 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:16,763 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371264065] [2023-12-02 17:44:16,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371264065] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:44:16,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2072532051] [2023-12-02 17:44:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:16,764 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:44:16,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:44:16,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:44:16,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-02 17:44:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:16,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 17:44:16,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:24,385 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:24,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:44:36,789 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:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2072532051] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:44:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640296102] [2023-12-02 17:44:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:36,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:36,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:36,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:44:36,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:44:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:36,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 17:44:36,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:44,697 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:44,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:44:45,397 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:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640296102] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:44:45,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 17:44:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 8, 8, 8] total 24 [2023-12-02 17:44:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802192767] [2023-12-02 17:44:45,398 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 17:44:45,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:44:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:44:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=422, Unknown=8, NotChecked=0, Total=552 [2023-12-02 17:44:45,402 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:49,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:44:50,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 17:44:52,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:44:54,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 17:45:05,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:45:07,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:45:09,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:45:10,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:45:14,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:45:16,236 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:45:18,243 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:45:20,247 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:45:22,254 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:45:24,259 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 [1] [2023-12-02 17:45:26,266 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:45:28,272 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:45:30,281 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:45:32,284 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:45:34,293 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:45:36,300 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:45:38,305 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 [1] [2023-12-02 17:45:40,317 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:45:42,320 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 [1] [2023-12-02 17:45:44,334 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:45:46,341 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:45:48,347 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:45:50,353 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:45:52,366 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:45:54,373 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:45:56,385 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:45:58,396 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 [1] [2023-12-02 17:46:00,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:46:09,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:46:20,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:46:22,134 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:46:23,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:46:26,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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:46:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:46:27,314 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-12-02 17:46:27,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 17:46:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:46:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:46:27,316 INFO L225 Difference]: With dead ends: 44 [2023-12-02 17:46:27,316 INFO L226 Difference]: Without dead ends: 32 [2023-12-02 17:46:27,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 69.9s TimeCoverageRelationStatistics Valid=205, Invalid=715, Unknown=10, NotChecked=0, Total=930 [2023-12-02 17:46:27,318 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:46:27,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 159 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 30 Unknown, 0 Unchecked, 78.0s Time] [2023-12-02 17:46:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-02 17:46:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-12-02 17:46:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 17:46:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-12-02 17:46:27,324 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 10 [2023-12-02 17:46:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:46:27,325 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-12-02 17:46:27,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:46:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-12-02 17:46:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 17:46:27,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:46:27,326 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:46:27,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:46:27,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:46:27,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-02 17:46:27,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:46:27,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:46:27,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:46:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2063348175, now seen corresponding path program 2 times [2023-12-02 17:46:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:46:27,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649776140] [2023-12-02 17:46:27,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:46:27,928 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:46:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:46:27,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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:46:27,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/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 [2023-12-02 17:46:48,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:46:48,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:46:48,199 WARN L260 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 17:46:48,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:59,924 WARN L293 SmtUtils]: Spent 19.12s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:49:20,117 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_29| (_ BitVec 8)) (|ULTIMATE.start_main1_~x~0#1| (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_29|))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_main1_~x~0#1|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse3))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))) (_ bv0 32)) (not (= (_ bv0 32) .cse0)) (not (bvsge .cse2 .cse1)) (bvslt .cse3 (_ bv0 32)) (not (bvslt .cse2 (_ bv0 32))))))))))) is different from false [2023-12-02 17:49:22,139 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_29| (_ BitVec 8)) (|ULTIMATE.start_main1_~x~0#1| (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_29|))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_main1_~x~0#1|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse3))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))) (_ bv0 32)) (not (= (_ bv0 32) .cse0)) (not (bvsge .cse2 .cse1)) (bvslt .cse3 (_ bv0 32)) (not (bvslt .cse2 (_ bv0 32))))))))))) is different from true [2023-12-02 17:49:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:49:22,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:53:02,824 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:53:10,552 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) |c_ULTIMATE.start_main1_~x~0#1|)) (.cse7 ((_ sign_extend 24) |c_ULTIMATE.start_gcd_test_~a#1|))) (or (not (bvsgt .cse0 (_ bv0 32))) (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse7 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (= .cse1 (_ bv0 32)) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse0 .cse3) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse3))) (_ bv0 32))))))))))) (bvslt .cse7 (_ bv0 32)))) is different from true [2023-12-02 17:53:33,694 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_11| (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_11|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse3))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (= .cse0 (_ bv0 32)) (bvsge .cse1 .cse2) (not (bvslt .cse3 (_ bv0 32))) (not (bvsgt .cse1 (_ bv0 32))) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse2))) (_ bv0 32))))))))))) is different from false [2023-12-02 17:53:35,728 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_11| (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_11|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse3))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (= .cse0 (_ bv0 32)) (bvsge .cse1 .cse2) (not (bvslt .cse3 (_ bv0 32))) (not (bvsgt .cse1 (_ bv0 32))) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse2))) (_ bv0 32))))))))))) is different from true [2023-12-02 17:53:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:53:35,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:53:35,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649776140] [2023-12-02 17:53:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649776140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:53:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151675718] [2023-12-02 17:53:35,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:53:35,730 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:53:35,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:53:35,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:53:35,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28973475-4462-45d7-926a-fa1c9146573f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 17:53:36,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:53:36,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:53:36,519 WARN L260 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 17:53:36,528 INFO L285 TraceCheckSpWp]: Computing forward predicates...