./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_6.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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/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 e2dd5d34f88ad6d47e063e6c09c7fec2ff27fac96724824e4298e1c863fcdc4b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:41:09,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:41:09,678 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:41:09,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:41:09,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:41:09,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:41:09,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:41:09,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:41:09,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:41:09,709 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:41:09,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:41:09,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:41:09,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:41:09,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:41:09,712 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:41:09,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:41:09,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:41:09,713 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:41:09,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:41:09,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:41:09,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:41:09,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:41:09,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:41:09,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:41:09,717 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:41:09,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:41:09,718 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:41:09,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:41:09,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:41:09,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:41:09,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:41:09,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:09,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:41:09,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:41:09,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:41:09,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:41:09,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:41:09,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:41:09,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:41:09,724 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:41:09,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:41:09,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:41:09,724 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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/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 -> e2dd5d34f88ad6d47e063e6c09c7fec2ff27fac96724824e4298e1c863fcdc4b [2023-11-29 06:41:09,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:41:09,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:41:09,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:41:09,971 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:41:09,971 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:41:09,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_2+newton_3_6.i [2023-11-29 06:41:12,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:41:12,940 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:41:12,940 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i [2023-11-29 06:41:12,947 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/data/bdda9c423/6dce6aad4c8e40a49257c78118c0cb36/FLAGa0bbde09f [2023-11-29 06:41:12,957 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/data/bdda9c423/6dce6aad4c8e40a49257c78118c0cb36 [2023-11-29 06:41:12,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:41:12,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:41:12,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:12,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:41:12,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:41:12,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:12" (1/1) ... [2023-11-29 06:41:12,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90d5dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:12, skipping insertion in model container [2023-11-29 06:41:12,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:12" (1/1) ... [2023-11-29 06:41:12,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:41:13,153 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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[1226,1239] [2023-11-29 06:41:13,178 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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[2862,2875] [2023-11-29 06:41:13,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:13,193 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:41:13,207 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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[1226,1239] [2023-11-29 06:41:13,217 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_79f8a8c3-51b0-4aad-8745-0d297dfed27c/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[2862,2875] [2023-11-29 06:41:13,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:13,233 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:41:13,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13 WrapperNode [2023-11-29 06:41:13,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:13,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:13,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:41:13,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:41:13,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,273 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-29 06:41:13,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:13,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:41:13,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:41:13,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:41:13,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,301 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 06:41:13,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:41:13,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:41:13,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:41:13,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:41:13,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (1/1) ... [2023-11-29 06:41:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:13,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:41:13,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:41:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:41:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 06:41:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 06:41:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 06:41:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 06:41:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:41:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:41:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:41:13,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:41:13,458 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:41:13,461 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:41:13,610 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:41:13,639 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:41:13,640 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:41:13,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:13 BoogieIcfgContainer [2023-11-29 06:41:13,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:41:13,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:41:13,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:41:13,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:41:13,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:41:12" (1/3) ... [2023-11-29 06:41:13,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78172ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:13, skipping insertion in model container [2023-11-29 06:41:13,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:13" (2/3) ... [2023-11-29 06:41:13,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78172ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:13, skipping insertion in model container [2023-11-29 06:41:13,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:13" (3/3) ... [2023-11-29 06:41:13,649 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_6.i [2023-11-29 06:41:13,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:41:13,663 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 06:41:13,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:41:13,711 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;@64cff6f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:41:13,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 06:41:13,715 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 06:41:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 06:41:13,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:13,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:13,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:41:13,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-11-29 06:41:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097752313] [2023-11-29 06:41:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:13,982 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 06:41:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097752313] [2023-11-29 06:41:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097752313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407870572] [2023-11-29 06:41:13,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:13,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:13,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:14,023 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 06:41:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:14,115 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2023-11-29 06:41:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:14,117 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 06:41:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:14,124 INFO L225 Difference]: With dead ends: 67 [2023-11-29 06:41:14,124 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 06:41:14,127 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 06:41:14,131 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 06:41:14,132 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 06:41:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 06:41:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-29 06:41:14,168 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 06:41:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-11-29 06:41:14,170 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2023-11-29 06:41:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:14,171 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-11-29 06:41:14,171 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 06:41:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-11-29 06:41:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 06:41:14,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:14,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:14,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:41:14,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:41:14,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:14,174 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-11-29 06:41:14,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909807676] [2023-11-29 06:41:14,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:14,254 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 06:41:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909807676] [2023-11-29 06:41:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909807676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966063130] [2023-11-29 06:41:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:14,272 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 06:41:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:14,309 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-11-29 06:41:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:14,310 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 06:41:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:14,326 INFO L225 Difference]: With dead ends: 34 [2023-11-29 06:41:14,326 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 06:41:14,327 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 06:41:14,329 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 06:41:14,329 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 06:41:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 06:41:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 06:41:14,336 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 06:41:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-29 06:41:14,338 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-11-29 06:41:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:14,338 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-29 06:41:14,338 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 06:41:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-29 06:41:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:41:14,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:14,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:14,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:41:14,340 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:41:14,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-11-29 06:41:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:14,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529196114] [2023-11-29 06:41:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:14,358 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:41:14,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901679792] [2023-11-29 06:41:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:14,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:14,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:41:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:14,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:41:14,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:14,529 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 06:41:14,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:14,582 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 06:41:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529196114] [2023-11-29 06:41:14,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:41:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901679792] [2023-11-29 06:41:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901679792] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:14,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:41:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-29 06:41:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936044869] [2023-11-29 06:41:14,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:14,587 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 06:41:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:14,649 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-29 06:41:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:14,649 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 06:41:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:14,650 INFO L225 Difference]: With dead ends: 35 [2023-11-29 06:41:14,651 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 06:41:14,651 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 06:41:14,652 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 06:41:14,653 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 06:41:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 06:41:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 06:41:14,658 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 06:41:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-11-29 06:41:14,660 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-11-29 06:41:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:14,660 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 06:41:14,660 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 06:41:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-11-29 06:41:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 06:41:14,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:14,661 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:14,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:14,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:14,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:41:14,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2023-11-29 06:41:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234056342] [2023-11-29 06:41:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:14,877 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:41:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870397038] [2023-11-29 06:41:14,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:41:14,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:14,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:14,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:41:14,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:41:14,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:41:14,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 06:41:14,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:38,661 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 06:41:38,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:03,659 WARN L293 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 136 DAG size of output: 134 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:42:19,476 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 06:42:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234056342] [2023-11-29 06:42:19,477 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:42:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870397038] [2023-11-29 06:42:19,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870397038] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:19,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:42:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 06:42:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676356303] [2023-11-29 06:42:19,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:19,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:42:19,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:42:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=139, Unknown=5, NotChecked=0, Total=182 [2023-11-29 06:42:19,480 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 06:42:52,871 WARN L293 SmtUtils]: Spent 23.51s on a formula simplification. DAG size of input: 312 DAG size of output: 313 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:42:56,897 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, 1] [2023-11-29 06:43:00,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 06:43:04,623 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, 1] [2023-11-29 06:43:05,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 06:43:10,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 06:43:14,458 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 06:43:33,616 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 06:43:37,636 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 06:43:54,301 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 06:43:58,325 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 06:44:00,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 06:44:05,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 06:44:10,576 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 06:44:14,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 06:44:33,709 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 06:44:35,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 06:44:37,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 06:44:39,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 06:45:02,605 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse7 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse80 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse81 (mod .cse9 256))) (let ((.cse53 (< .cse81 128)) (.cse45 (< .cse80 128)) (.cse13 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse42 (< 0 .cse7)) (.cse43 (< 127 .cse81)) (.cse52 (< 127 .cse80)) (.cse44 (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 ((.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse41 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse4 (or .cse42 .cse43 .cse52 .cse44)) (.cse37 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse78 (mod (+ .cse79 .cse9) 256))) (or (< .cse78 .cse13) (< (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse79 256)) (< .cse78 128) (= .cse79 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse24 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse77 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse77 .cse9) 256))) (or (< .cse76 .cse13) (< (mod .cse77 256) 128) (< (mod (+ .cse77 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse76 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse28 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod .cse75 256))) (or (< .cse74 .cse13) (< .cse74 128) (< 127 (mod (+ .cse75 .cse9) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse25 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse73 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse72 (mod .cse73 256))) (or (< .cse72 .cse13) (< .cse72 128) (< (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse73 .cse9) 256) 128)))))) (.cse36 (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 ((.cse71 (mod (+ .cse70 .cse9) 256))) (or (< (mod .cse70 256) 128) (< (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse71) (< .cse71 .cse7) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse10 (or .cse42 .cse44 .cse53 .cse45)) (.cse35 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse69 .cse9) 256))) (or (< .cse68 .cse13) (< 127 (mod .cse69 256)) (< 127 (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse68 128) (= .cse69 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse38 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod (+ .cse66 .cse9) 256))) (or (< (mod .cse66 256) 128) (< 127 .cse67) (< .cse67 .cse7) (< 127 (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse11 (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 .cse7) (< (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse64) (< (mod (+ .cse65 .cse9) 256) 128)))))) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse63 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod .cse63 256))) (or (< .cse62 .cse13) (< .cse62 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse63 .cse9) 256) 128)))))) (.cse23 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse61 256))) (or (< .cse60 .cse13) (< .cse60 128) (< (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse61 .cse9) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse5 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse58 (mod .cse59 256))) (or (< .cse58 .cse7) (< 127 (mod (+ .cse59 .cse9) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse58) (< 127 (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse16 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse57 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse56 (mod .cse57 256))) (or (< .cse56 .cse7) (< (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse57 .cse9) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse56)))))) (.cse17 (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 ((.cse55 (mod (+ .cse54 .cse9) 256))) (or (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse55) (< .cse55 .cse7) (< 127 (mod .cse54 256)) (= .cse54 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse31 (or .cse42 .cse52 .cse44 .cse53)) (.cse15 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse51 .cse9) 256))) (or (< 127 .cse50) (< .cse50 .cse7) (< 127 (mod .cse51 256)) (< 127 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse51 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse1 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse49 .cse9) 256))) (or (< .cse48 .cse13) (< (mod .cse49 256) 128) (< 127 (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse48 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse32 (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 ((.cse46 (mod .cse47 256))) (or (< .cse46 .cse7) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse46) (< 127 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse47 .cse9) 256) 128)))))) (.cse18 (or .cse42 .cse43 .cse44 .cse45))) (and (or (let ((.cse3 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1)))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse5 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse6 .cse7) (< 127 (mod (+ .cse8 .cse9) 256)) (< 127 (mod .cse8 256)) (< 127 .cse6) (= .cse8 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse3 (and .cse10 .cse11 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse12 128) (< .cse12 .cse13) (< 127 (mod .cse14 256)) (< (mod (+ .cse14 .cse9) 256) 128) (= .cse14 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse2 (and .cse4 .cse5 .cse15)) (or (and .cse16 .cse17 .cse18) .cse2) (or .cse3 (and .cse16 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse19 128) (< .cse19 .cse13) (< 127 (mod (+ .cse20 .cse9) 256)) (< 127 (mod .cse20 256)) (= .cse20 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse18)) (or .cse3 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse21 256) 128) (< .cse22 128) (< .cse22 .cse13) (< 127 (mod (+ .cse21 .cse9) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse23)) (or .cse2 (and .cse24 .cse25)) (or .cse3 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse26 256) 128) (< .cse27 .cse7) (< 127 .cse27) (< (mod (+ .cse26 .cse9) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse3 (and .cse28 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse29 256) 128) (< .cse30 .cse7) (< 127 (mod (+ .cse29 .cse9) 256)) (< 127 .cse30) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse3 (and .cse31 .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse33 .cse7) (< 127 (mod .cse34 256)) (< 127 .cse33) (< (mod (+ .cse34 .cse9) 256) 128) (= .cse34 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse2 (and .cse35 .cse31 .cse32)) (or (and .cse36 .cse23) .cse2) (or .cse2 (and .cse37 .cse10 .cse11)) (or .cse2 (and .cse28 .cse38)) (or .cse3 (and .cse25 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse39 256) 128) (< .cse40 128) (< .cse40 .cse13) (< (mod (+ .cse39 .cse9) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) .cse41) (or .cse2 .cse41 (and .cse4 .cse37 .cse24 .cse28 .cse25 .cse36 .cse10 .cse35 .cse38 .cse11 .cse0 .cse23 .cse5 .cse16 .cse17 .cse31 .cse15 .cse1 .cse32 .cse18))))))) is different from true [2023-11-29 06:45:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:45:03,162 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-29 06:45:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:45:03,162 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 06:45:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:45:03,163 INFO L225 Difference]: With dead ends: 40 [2023-11-29 06:45:03,163 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 06:45:03,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 141.7s TimeCoverageRelationStatistics Valid=83, Invalid=286, Unknown=15, NotChecked=36, Total=420 [2023-11-29 06:45:03,165 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 67.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:45:03,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 12 Unknown, 13 Unchecked, 67.5s Time] [2023-11-29 06:45:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 06:45:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 06:45:03,175 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 06:45:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 06:45:03,176 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-29 06:45:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:45:03,176 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 06:45:03,176 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 06:45:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 06:45:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:45:03,177 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:45:03,177 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:45:03,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:45:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:45:03,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:45:03,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:45:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2045375020, now seen corresponding path program 3 times [2023-11-29 06:45:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:45:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613605488] [2023-11-29 06:45:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:45:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:45:03,389 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:45:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170830700] [2023-11-29 06:45:03,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:45:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:45:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:45:03,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:45:03,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f8a8c3-51b0-4aad-8745-0d297dfed27c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:45:03,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 06:45:03,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:45:03,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 06:45:03,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:45:47,437 WARN L293 SmtUtils]: Spent 15.10s on a formula simplification. DAG size of input: 80 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:46:36,276 WARN L293 SmtUtils]: Spent 11.66s 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 06:47:25,379 WARN L293 SmtUtils]: Spent 17.62s 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 06:48:10,203 WARN L293 SmtUtils]: Spent 14.36s 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 06:48:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:48:20,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:49:33,470 WARN L293 SmtUtils]: Spent 5.02s 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:52:26,775 WARN L293 SmtUtils]: Spent 2.33m 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:53:06,012 WARN L293 SmtUtils]: Spent 6.40s 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:53:22,009 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:53:28,709 WARN L293 SmtUtils]: Spent 5.93s 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:53:36,922 WARN L293 SmtUtils]: Spent 7.97s 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:54:12,078 WARN L293 SmtUtils]: Spent 8.03s 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:54:29,873 WARN L293 SmtUtils]: Spent 8.02s 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:54:35,126 WARN L293 SmtUtils]: Spent 5.25s 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:54:45,250 WARN L293 SmtUtils]: Spent 7.32s 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:54:59,827 WARN L293 SmtUtils]: Spent 7.62s 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:55:08,451 WARN L293 SmtUtils]: Spent 5.01s 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:55:14,856 WARN L293 SmtUtils]: Spent 6.40s 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:55:28,531 WARN L293 SmtUtils]: Spent 6.05s 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:55:37,995 WARN L293 SmtUtils]: Spent 6.91s 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:55:50,712 WARN L293 SmtUtils]: Spent 8.03s 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:56:00,135 WARN L293 SmtUtils]: Spent 6.41s 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:56:18,022 WARN L293 SmtUtils]: Spent 8.03s 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:56:32,864 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)