./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 803cbc2ab2fb54f2ccf794a1cf55b1df2243f22f996d0e59d0f49967facf7958 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:51:39,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:51:39,918 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:51:39,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:51:39,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:51:39,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:51:39,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:51:39,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:51:39,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:51:39,949 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:51:39,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:51:39,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:51:39,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:51:39,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:51:39,952 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:51:39,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:51:39,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:51:39,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:51:39,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:51:39,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:51:39,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:51:39,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:51:39,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:51:39,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:51:39,957 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:51:39,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:51:39,958 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:51:39,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:51:39,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:51:39,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:51:39,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:51:39,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:51:39,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:51:39,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:51:39,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:51:39,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:51:39,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:51:39,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:51:39,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:51:39,962 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:51:39,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:51:39,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:51:39,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/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_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 803cbc2ab2fb54f2ccf794a1cf55b1df2243f22f996d0e59d0f49967facf7958 [2023-11-29 05:51:40,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:51:40,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:51:40,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:51:40,199 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:51:40,199 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:51:40,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_2+newton_3_7.i [2023-11-29 05:51:42,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:51:43,119 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:51:43,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i [2023-11-29 05:51:43,126 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/data/5b72968d1/f140f88c4caf4139a513c6cc1d2032c6/FLAGfc1640e01 [2023-11-29 05:51:43,137 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/data/5b72968d1/f140f88c4caf4139a513c6cc1d2032c6 [2023-11-29 05:51:43,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:51:43,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:51:43,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:51:43,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:51:43,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:51:43,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eff0374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43, skipping insertion in model container [2023-11-29 05:51:43,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:51:43,294 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_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[1226,1239] [2023-11-29 05:51:43,317 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_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[2862,2875] [2023-11-29 05:51:43,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:51:43,333 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:51:43,344 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_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[1226,1239] [2023-11-29 05:51:43,355 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_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[2862,2875] [2023-11-29 05:51:43,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:51:43,369 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:51:43,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43 WrapperNode [2023-11-29 05:51:43,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:51:43,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:51:43,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:51:43,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:51:43,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,407 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-29 05:51:43,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:51:43,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:51:43,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:51:43,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:51:43,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,431 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 05:51:43,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:51:43,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:51:43,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:51:43,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:51:43,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (1/1) ... [2023-11-29 05:51:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:51:43,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:43,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:51:43,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:51:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:51:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 05:51:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 05:51:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 05:51:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 05:51:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:51:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:51:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:51:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:51:43,576 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:51:43,578 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:51:43,726 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:51:43,748 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:51:43,748 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:51:43,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:51:43 BoogieIcfgContainer [2023-11-29 05:51:43,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:51:43,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:51:43,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:51:43,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:51:43,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:51:43" (1/3) ... [2023-11-29 05:51:43,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f9d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:51:43, skipping insertion in model container [2023-11-29 05:51:43,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:51:43" (2/3) ... [2023-11-29 05:51:43,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f9d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:51:43, skipping insertion in model container [2023-11-29 05:51:43,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:51:43" (3/3) ... [2023-11-29 05:51:43,758 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_7.i [2023-11-29 05:51:43,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:51:43,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:51:43,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:51:43,828 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=PETRI_NET, 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;@1e13f13f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:51:43,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 05:51:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:51:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:51:43,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:43,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:43,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:43,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-11-29 05:51:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711524817] [2023-11-29 05:51:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:51:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711524817] [2023-11-29 05:51:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711524817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47884119] [2023-11-29 05:51:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:44,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:51:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:51:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:51:44,108 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 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-11-29 05:51:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:44,196 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2023-11-29 05:51:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:51:44,198 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-11-29 05:51:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:44,205 INFO L225 Difference]: With dead ends: 67 [2023-11-29 05:51:44,205 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 05:51:44,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:44,212 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:44,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:51:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 05:51:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-29 05:51:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:51:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-11-29 05:51:44,248 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2023-11-29 05:51:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:44,248 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-11-29 05:51:44,249 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-11-29 05:51:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-11-29 05:51:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:51:44,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:44,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:44,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:51:44,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:44,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-11-29 05:51:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796943485] [2023-11-29 05:51:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:51:44,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796943485] [2023-11-29 05:51:44,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796943485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:44,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:44,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716337071] [2023-11-29 05:51:44,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:44,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:51:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:44,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:51:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:51:44,350 INFO L87 Difference]: Start difference. First operand 28 states and 33 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-11-29 05:51:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:44,404 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-11-29 05:51:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:51:44,404 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-11-29 05:51:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:44,405 INFO L225 Difference]: With dead ends: 34 [2023-11-29 05:51:44,405 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:51:44,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:44,407 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:44,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:51:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:51:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 05:51:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:51:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-29 05:51:44,419 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-11-29 05:51:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:44,420 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-29 05:51:44,420 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-11-29 05:51:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-29 05:51:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:51:44,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:44,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:44,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:51:44,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:44,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-11-29 05:51:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:44,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043786562] [2023-11-29 05:51:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:44,437 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:51:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495422743] [2023-11-29 05:51:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:44,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:44,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:44,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:51:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:44,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:51:44,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:51:44,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:51:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043786562] [2023-11-29 05:51:44,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:51:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495422743] [2023-11-29 05:51:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495422743] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:51:44,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:51:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-29 05:51:44,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744253758] [2023-11-29 05:51:44,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:51:44,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:51:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:51:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:51:44,642 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-11-29 05:51:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:44,703 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-29 05:51:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:51:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 10 [2023-11-29 05:51:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:44,704 INFO L225 Difference]: With dead ends: 35 [2023-11-29 05:51:44,705 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 05:51:44,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:51:44,706 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:44,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:51:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 05:51:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 05:51:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:51:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-11-29 05:51:44,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-11-29 05:51:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:44,714 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 05:51:44,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-11-29 05:51:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-11-29 05:51:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:51:44,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:44,715 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:44,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:51:44,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:44,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:44,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2023-11-29 05:51:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380807237] [2023-11-29 05:51:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:44,928 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:51:44,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691666273] [2023-11-29 05:51:44,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:51:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:44,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:44,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:51:44,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:51:44,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:51:44,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 05:51:44,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:52:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:52:08,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:52:56,871 WARN L293 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:52:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:52:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:52:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380807237] [2023-11-29 05:52:58,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:52:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691666273] [2023-11-29 05:52:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691666273] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:52:58,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:52:58,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 05:52:58,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252986692] [2023-11-29 05:52:58,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:52:58,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:52:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:52:58,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:52:58,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=137, Unknown=7, NotChecked=0, Total=182 [2023-11-29 05:52:58,292 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-11-29 05:53:03,761 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse10) (< 126 |c_ULTIMATE.start_main1_~y~0#1|)) (let ((.cse73 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse86 (<= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse74 (mod (+ .cse75 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse74) (<= 128 (mod .cse75 256)) (<= 128 .cse74) (<= 128 (mod (+ .cse75 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse77 (mod (+ .cse76 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse76 0)) (<= (mod .cse76 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse77 127) (<= (mod (+ .cse76 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse77))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse79 (mod (+ .cse78 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse78 0)) (<= 128 (mod (+ .cse78 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse78 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse79 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse79))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse80 (mod .cse81 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse80) (<= .cse80 127) (<= (mod (+ .cse81 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse81 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse83 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse82 (mod .cse83 256))) (and (<= 128 .cse82) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ .cse83 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse83 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse82))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse85 (mod .cse84 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse84 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse85) (<= .cse85 127) (<= (mod (+ .cse84 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_7 Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse89 (* 256 v_y_9)) (.cse90 (* 255 v_z_9))) (let ((.cse87 (+ .cse89 .cse90)) (.cse88 (+ .cse89 .cse90 (* 256 v_y_7)))) (and (<= v_z_9 255) (<= 128 .cse87) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_9) (<= .cse87 255) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse88) 0) (<= 0 .cse88)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse91 (mod (+ .cse92 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse91) (<= 128 (mod .cse92 256)) (<= 128 .cse91) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse92 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse93 (mod .cse94 256))) (and (<= 128 .cse93) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse94 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= (mod (+ .cse94 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse93))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse95 (mod .cse96 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse95) (<= 128 (mod (+ .cse96 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse95 127) (<= (mod (+ .cse96 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127))))))) (and .cse86 (exists ((v_z_3 Int) (v_y_3 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_1 Int)) (let ((.cse99 (* 255 v_z_3)) (.cse100 (* 256 v_y_3))) (let ((.cse97 (+ (* 256 v_y_1) .cse99 .cse100)) (.cse98 (+ .cse99 .cse100))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse97) 0) (<= 0 .cse98) (<= 0 .cse97) (<= .cse97 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_3) (<= v_z_3 255) (<= .cse98 127)))))) (and (exists ((v_y_4 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_6 Int) (v_z_6 Int)) (let ((.cse103 (* 256 v_y_6)) (.cse104 (* 255 v_z_6))) (let ((.cse102 (+ (* 256 v_y_4) .cse103 .cse104)) (.cse101 (+ .cse103 .cse104))) (and (<= .cse101 127) (<= v_z_6 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse102) 0) (<= .cse102 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse102 0)) (<= 0 .cse102) (<= 0 .cse101))))) .cse86) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse106 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse105 (mod .cse106 256))) (and (<= 128 .cse105) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse106 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse106 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse73 .cse105))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse108 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse107 (mod (+ .cse108 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse107) (not (= .cse108 0)) (<= 128 .cse107) (<= (mod .cse108 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse108 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse109 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse110 (mod .cse109 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse109 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse110) (<= 128 (mod (+ .cse109 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse110 127))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse111 (mod .cse112 256))) (and (<= 128 .cse111) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse112 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod (+ .cse112 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= .cse73 .cse111))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse113 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse114 (mod (+ .cse113 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse113 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse114 127) (<= (mod (+ .cse113 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse114))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse116 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse115 (mod (+ .cse116 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse115) (not (= .cse116 0)) (<= 128 .cse115) (<= 128 (mod (+ .cse116 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse116 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse117 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse118 (mod (+ .cse117 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse117 256)) (<= 128 (mod (+ .cse117 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse118 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse118))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse121 (* v_y_12 256)) (.cse122 (* v_z_12 255))) (let ((.cse120 (+ .cse121 .cse122 (* v_y_11 256))) (.cse119 (+ .cse121 .cse122))) (and (<= 128 .cse119) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse120) 0) (<= v_z_12 127) (<= .cse120 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_12) (<= 0 .cse120) (<= .cse119 255)))))))))) is different from true [2023-11-29 05:53:19,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:53:23,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:53:39,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:53:43,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:53:47,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 05:53:52,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:53:56,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:54:01,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 05:54:14,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:54:18,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:54:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:54:44,278 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-29 05:54:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:54:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 05:54:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:54:44,280 INFO L225 Difference]: With dead ends: 40 [2023-11-29 05:54:44,280 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 05:54:44,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 114.8s TimeCoverageRelationStatistics Valid=81, Invalid=290, Unknown=13, NotChecked=36, Total=420 [2023-11-29 05:54:44,281 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 44.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:54:44,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 9 Unknown, 10 Unchecked, 44.8s Time] [2023-11-29 05:54:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 05:54:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 05:54:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:54:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 05:54:44,294 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-29 05:54:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:54:44,294 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 05:54:44,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-11-29 05:54:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 05:54:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 05:54:44,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:44,296 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:44,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:54:44,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:54:44,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:54:44,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2045375020, now seen corresponding path program 3 times [2023-11-29 05:54:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579907809] [2023-11-29 05:54:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:44,506 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:54:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758919755] [2023-11-29 05:54:44,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:54:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:54:44,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:54:44,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:54:44,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d8e16a-aa8e-4b5b-9118-94c27e460d44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:54:44,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 05:54:44,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:54:44,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 05:54:44,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:53,141 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse0) 256)) (not (= .cse0 0)))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse14 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse36 (mod .cse14 256))) (let ((.cse23 (<= 128 .cse36)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (<= 128 .cse35)) (.cse32 (<= .cse36 127)) (.cse22 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))) (.cse27 (<= .cse35 127))) (let ((.cse7 (or (and .cse32 .cse22 .cse24 .cse27) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse33 (mod .cse34 256))) (and (<= .cse33 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse33) (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse34 .cse14) 256) 127))))))) (.cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse31 (mod .cse30 256))) (and (<= 128 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse31 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse31) (<= (mod (+ .cse30 .cse14) 256) 127))))) (and .cse21 .cse32 .cse22 .cse24))) (.cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse28 (mod .cse29 256))) (and (<= 128 .cse28) (= .cse28 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse29 .cse14) 256) 127)))))) (.cse3 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse25 (mod .cse26 256))) (and (<= .cse25 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse25) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse26 .cse14) 256)))))) (and .cse22 .cse23 .cse24 .cse27))) (.cse2 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse20 (mod .cse19 256))) (and (<= 128 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse20 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse20) (<= 128 (mod (+ .cse19 .cse14) 256)))))) (and .cse21 .cse22 .cse23 .cse24))) (.cse1 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse18 (mod .cse17 256))) (and (<= 128 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse18) (= .cse18 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse17 .cse14) 256) 127)))))) (.cse9 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse16 256))) (and (<= 128 .cse15) (= .cse15 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse16 .cse14) 256))))))) (.cse5 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse12 (mod .cse11 256))) (and (<= 128 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse12) (= .cse12 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (mod (+ .cse11 .cse14) 256)))))))) (or (and .cse1 .cse2) (and .cse1 .cse3) (and .cse4 .cse1) (and .cse5 .cse6) (and .cse5 .cse7) (and .cse1 .cse7) (and .cse8 .cse1) (and .cse1 .cse6) (and .cse8 .cse5) (and .cse5 .cse3) (and .cse1 .cse9) (and .cse5 .cse2) (and .cse1 .cse10) (and .cse4 .cse5) (and .cse5 .cse9) (and .cse5 .cse10)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2023-11-29 05:55:16,444 WARN L293 SmtUtils]: Spent 11.00s on a formula simplification. DAG size of input: 82 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:55:43,688 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 81 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:56:18,264 WARN L293 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:56:45,204 WARN L293 SmtUtils]: Spent 13.24s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:56:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 05:56:53,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:09,635 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:23,957 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:36,651 WARN L293 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:01:02,675 WARN L293 SmtUtils]: Spent 2.15m on a formula simplification. DAG size of input: 90 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:01:13,790 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:16,262 WARN L293 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:47,526 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:59,469 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:03:11,531 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:03:33,527 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:03:40,592 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:03:47,450 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:03:56,882 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:04:18,855 WARN L293 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:04:27,008 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:04:33,571 WARN L293 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:04:39,682 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:04:46,435 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:04:57,381 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:05,045 WARN L293 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:11,372 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:18,308 WARN L293 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:24,280 WARN L293 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:34,286 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:42,939 WARN L293 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 5 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:05:48,528 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:06:02,335 WARN L293 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:06:11,321 WARN L293 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:06:19,345 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:06:39,218 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:06:46,916 WARN L293 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:06:58,862 WARN L293 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)