./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc7e3777189fad7ccb3c88448fa9a78354a62d55c3114c1026ddd9265244ab9e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:21:09,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:21:09,525 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:21:09,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:21:09,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:21:09,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:21:09,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:21:09,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:21:09,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:21:09,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:21:09,563 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:21:09,564 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:21:09,565 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:21:09,565 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:21:09,566 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:21:09,566 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:21:09,567 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:21:09,568 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:21:09,568 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:21:09,569 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:21:09,570 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:21:09,571 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:21:09,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:21:09,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:21:09,573 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:21:09,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:21:09,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:21:09,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:21:09,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:21:09,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:21:09,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:21:09,580 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:21:09,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:21:09,581 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:21:09,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:21:09,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:21:09,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:21:09,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:21:09,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:21:09,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:21:09,612 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:21:09,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:21:09,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:21:09,613 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:21:09,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:21:09,614 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/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_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc7e3777189fad7ccb3c88448fa9a78354a62d55c3114c1026ddd9265244ab9e [2023-11-19 05:21:09,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:21:09,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:21:09,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:21:09,970 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:21:09,972 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:21:09,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/combinations/gcd_3+newton_3_1.i [2023-11-19 05:21:13,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:21:13,440 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:21:13,441 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/sv-benchmarks/c/combinations/gcd_3+newton_3_1.i [2023-11-19 05:21:13,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/data/8631d4454/c5531308c9fa403a8d84e082622e9c88/FLAG82d1bb3b7 [2023-11-19 05:21:13,478 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/data/8631d4454/c5531308c9fa403a8d84e082622e9c88 [2023-11-19 05:21:13,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:21:13,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:21:13,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:21:13,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:21:13,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:21:13,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28188f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13, skipping insertion in model container [2023-11-19 05:21:13,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:21:13,740 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_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/sv-benchmarks/c/combinations/gcd_3+newton_3_1.i[1226,1239] [2023-11-19 05:21:13,773 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_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/sv-benchmarks/c/combinations/gcd_3+newton_3_1.i[2862,2875] [2023-11-19 05:21:13,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:21:13,788 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:21:13,805 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_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/sv-benchmarks/c/combinations/gcd_3+newton_3_1.i[1226,1239] [2023-11-19 05:21:13,819 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_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/sv-benchmarks/c/combinations/gcd_3+newton_3_1.i[2862,2875] [2023-11-19 05:21:13,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:21:13,840 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:21:13,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13 WrapperNode [2023-11-19 05:21:13,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:21:13,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:21:13,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:21:13,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:21:13,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,887 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-19 05:21:13,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:21:13,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:21:13,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:21:13,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:21:13,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:21:13,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:21:13,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:21:13,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:21:13,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (1/1) ... [2023-11-19 05:21:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:21:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:13,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:21:13,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:21:14,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:21:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-19 05:21:14,027 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-19 05:21:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-19 05:21:14,028 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-19 05:21:14,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:21:14,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:21:14,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:21:14,114 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:21:14,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:21:14,348 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:21:14,442 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:21:14,453 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 05:21:14,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:21:14 BoogieIcfgContainer [2023-11-19 05:21:14,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:21:14,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:21:14,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:21:14,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:21:14,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:21:13" (1/3) ... [2023-11-19 05:21:14,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcf1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:21:14, skipping insertion in model container [2023-11-19 05:21:14,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:13" (2/3) ... [2023-11-19 05:21:14,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcf1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:21:14, skipping insertion in model container [2023-11-19 05:21:14,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:21:14" (3/3) ... [2023-11-19 05:21:14,468 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_1.i [2023-11-19 05:21:14,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:21:14,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 05:21:14,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:21:14,539 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cc4e5ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:21:14,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-19 05:21:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:21:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:21:14,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:14,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:21:14,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:14,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -291944571, now seen corresponding path program 1 times [2023-11-19 05:21:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913399141] [2023-11-19 05:21:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:15,158 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-19 05:21:15,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:21:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913399141] [2023-11-19 05:21:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913399141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:21:15,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:21:15,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:21:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824663118] [2023-11-19 05:21:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:21:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:21:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:21:15,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:21:15,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:21:15,223 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:21:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:21:15,350 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-11-19 05:21:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:21:15,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 05:21:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:21:15,364 INFO L225 Difference]: With dead ends: 40 [2023-11-19 05:21:15,364 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 05:21:15,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:21:15,377 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:21:15,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:21:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 05:21:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 05:21:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:21:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-19 05:21:15,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2023-11-19 05:21:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:21:15,435 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-19 05:21:15,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:21:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-19 05:21:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 05:21:15,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:15,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:21:15,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:21:15,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:15,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash -533010262, now seen corresponding path program 1 times [2023-11-19 05:21:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:15,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804268891] [2023-11-19 05:21:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:15,477 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-19 05:21:15,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692219214] [2023-11-19 05:21:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:15,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:15,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:15,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:21:15,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:21:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:15,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 05:21:15,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:21:18,064 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse8 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse1 (<= .cse2 127)) (.cse7 (<= 128 .cse2)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse2 (- 256))) (.cse3 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse5 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse5 0)) (= (mod (+ .cse5 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse6))))) .cse7))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)))) .cse8) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)))) .cse8) (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse7 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse9 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse6) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse9 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse3)))))))) is different from true [2023-11-19 05:21:18,434 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse4 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse0 (<= .cse1 127)) (.cse3 (+ .cse1 (- 256))) (.cse2 (<= 128 .cse1))) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse4) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse5) (and .cse4 (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse2)))))) is different from true [2023-11-19 05:21:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 05:21:18,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:21:19,764 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-19 05:21:19,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:21:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804268891] [2023-11-19 05:21:19,765 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-19 05:21:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692219214] [2023-11-19 05:21:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692219214] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:21:19,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [364458352] [2023-11-19 05:21:19,798 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-11-19 05:21:19,798 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:21:19,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:21:19,810 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:21:19,811 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:21:21,899 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:21:22,228 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '168#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 1 |ULTIMATE.start_main1_~x~0#1|) (<= (+ |ULTIMATE.start_main1_~x~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)))' at error location [2023-11-19 05:21:22,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:21:22,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:21:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-19 05:21:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194215584] [2023-11-19 05:21:22,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:21:22,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 05:21:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:21:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 05:21:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=129, Unknown=2, NotChecked=46, Total=210 [2023-11-19 05:21:22,235 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:21:22,300 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (not .cse0) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse2) (let ((.cse5 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse10 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (<= .cse1 0)) (.cse4 (<= .cse5 127)) (.cse9 (<= 128 .cse5)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (+ .cse5 (- 256)))) (or (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse7 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse7 0)) (= (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse8))))) .cse9))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)))) .cse10) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)))) .cse10) (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse9 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse11 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse8) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse11 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse0)))))))) (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1) .cse2 (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (and (or (not (= (mod .cse12 256) 0)) (and (<= .cse13 0) (not (= .cse12 0)))) (or (not (= (mod (+ .cse12 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 0)) (< 0 .cse13))))))) is different from true [2023-11-19 05:21:22,323 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< |c_ULTIMATE.start_main1_~g~0#1| .cse0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse6 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (<= .cse0 0)) (.cse1 (<= .cse2 127)) (.cse4 (+ .cse2 (- 256))) (.cse3 (<= 128 .cse2))) (or (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse6) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse6) (and .cse5 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse3)))))))) is different from true [2023-11-19 05:21:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:21:22,517 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2023-11-19 05:21:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:21:22,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 05:21:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:21:22,520 INFO L225 Difference]: With dead ends: 32 [2023-11-19 05:21:22,520 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 05:21:22,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=152, Unknown=4, NotChecked=108, Total=306 [2023-11-19 05:21:22,522 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:21:22,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2023-11-19 05:21:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 05:21:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-19 05:21:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:21:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-19 05:21:22,538 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2023-11-19 05:21:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:21:22,538 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 05:21:22,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:21:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-19 05:21:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:21:22,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:22,544 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-11-19 05:21:22,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 05:21:22,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:22,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:22,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 847992842, now seen corresponding path program 2 times [2023-11-19 05:21:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056148568] [2023-11-19 05:21:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:22,774 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-19 05:21:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175496263] [2023-11-19 05:21:22,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:21:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:22,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:21:22,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e398c36b-f5a4-4f21-83bb-4c06ee6c5133/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:21:22,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 05:21:22,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:21:22,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 05:21:22,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:21:42,709 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 97 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-19 05:21:53,654 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse1 (<= .cse6 127)) (.cse22 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse12 (+ .cse6 (- 256))) (.cse8 (<= 128 .cse6)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse23 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse19 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse18 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (or (and .cse0 (or (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse5 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse2 (mod .cse5 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse2))) (and (= (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse2 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse3 (mod (+ .cse4 (* .cse5 255)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse4 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse7 (mod (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (= (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse7 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse7) 256))))))) (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse10 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse11 (+ (- 256) (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256)))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse11))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse3 (mod (+ .cse9 .cse10 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse9 0)) (= (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse13 (+ (mod (+ (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_34|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_34|)) 256) (- 256)))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse13) 256)) (= (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|)))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (not (= .cse14 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod .cse14 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse14) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse15 (mod .cse16 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse15))) (and (not (= .cse15 0)) (= .cse3 (mod (+ (* 255 .cse16) .cse17) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse17 0)))))))) .cse18)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (and .cse8 .cse0 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse20 (+ (mod (+ (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_34|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_34|)) 256) (- 256)))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse20) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod (+ .cse21 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) 256) .cse22) (not (= .cse21 0))))))) (and .cse0 .cse1 (or (and .cse23 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse26 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse24 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse24))) (and (not (= .cse24 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse3 (mod (+ .cse25 (* .cse26 255)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse24 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse25 0)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse27 (mod (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse27) 256))))) .cse19))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse30 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse29 (+ (- 256) (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256)))) (let ((.cse28 (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse28 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse28) 256) .cse22) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse3 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse29) .cse30 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|))))))) .cse8 .cse0 .cse23) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse31 (mod .cse32 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse31))) (and (not (= .cse31 0)) (= .cse3 (mod (+ (* 255 .cse32) .cse33) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse33 0))))))) .cse23) (and .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse34 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (not (= .cse34 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse34) 256))))))) .cse18)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-11-19 05:22:00,971 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse3 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse1 (<= .cse3 127)) (.cse18 (<= 0 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse7 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse13 (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0))) (or (and .cse0 (or (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse2 (mod (mod .cse3 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (not (= .cse2 0)) (= (mod .cse2 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse2) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse6 (mod .cse3 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse4 (mod .cse6 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse4))) (and (not (= .cse4 0)) (= (mod (+ .cse5 (* .cse6 255)) 256) .cse7) (= (mod .cse4 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse5 0))))))))) (and (let ((.cse11 (+ .cse3 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse10 (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse8 (+ (- 256) (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256)))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse8))) (and (= (mod .cse8 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= (mod (+ .cse9 .cse10 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256) .cse7) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse9 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse12 (+ (mod (+ (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_34|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_34|)) 256) (- 256)))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse12) 256)) (= (mod .cse12 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|)))))) (<= 128 .cse3)))) (and (or (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse14 (mod .cse15 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse14))) (and (= (mod (mod .cse14 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (not (= .cse14 0)) (= .cse7 (mod (+ (* 255 .cse15) .cse16) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse16 0)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse17 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (= (mod (mod .cse17 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (not (= .cse17 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse17) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|)))) .cse18)) .cse19) (and .cse19 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse20 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (not (= .cse20 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse20) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse21 (mod .cse22 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse21))) (and (not (= .cse21 0)) (= .cse7 (mod (+ (* 255 .cse22) .cse23) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse23 0))))))))) (and .cse0 .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse24 (mod (mod .cse3 |v_ULTIMATE.start_gcd_test_~a#1_34|) 256))) (and (= (mod (mod .cse24 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (not (= .cse24 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse24) 256))))) .cse18) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse27 (mod .cse3 |v_ULTIMATE.start_gcd_test_~a#1_34|))) (let ((.cse25 (mod .cse27 256))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse25))) (and (= (mod (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (not (= .cse25 0)) (= (mod (+ .cse26 (* .cse27 255)) 256) .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse26 0))))))) .cse13)))))) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2023-11-19 05:22:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-19 05:22:08,685 INFO L327 TraceCheckSpWp]: Computing backward predicates...