./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:41:37,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:41:37,825 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:41:37,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:41:37,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:41:37,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:41:37,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:41:37,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:41:37,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:41:37,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:41:37,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:41:37,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:41:37,861 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:41:37,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:41:37,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:41:37,863 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:41:37,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:41:37,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:41:37,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:41:37,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:41:37,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:41:37,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:41:37,866 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:41:37,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:41:37,867 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:41:37,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:41:37,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:41:37,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:41:37,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:41:37,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:41:37,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:41:37,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:41:37,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:41:37,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:41:37,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:41:37,871 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:41:37,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:41:37,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:41:37,873 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:41:37,873 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_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/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_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 [2023-11-06 22:41:38,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:41:38,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:41:38,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:41:38,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:41:38,234 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:41:38,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2023-11-06 22:41:41,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:41:41,549 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:41:41,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2023-11-06 22:41:41,560 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/data/57c8200e0/2cc8fa903c594062b3c6e98856c49543/FLAG7088d5276 [2023-11-06 22:41:41,579 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/data/57c8200e0/2cc8fa903c594062b3c6e98856c49543 [2023-11-06 22:41:41,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:41:41,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:41:41,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:41,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:41:41,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:41:41,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:41,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e31505b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41, skipping insertion in model container [2023-11-06 22:41:41,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:41,632 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:41:41,893 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_bdacc6ff-653c-4906-ad13-bbcada100500/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[1226,1239] [2023-11-06 22:41:41,920 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_bdacc6ff-653c-4906-ad13-bbcada100500/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[2862,2875] [2023-11-06 22:41:41,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:41,932 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:41:41,946 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_bdacc6ff-653c-4906-ad13-bbcada100500/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[1226,1239] [2023-11-06 22:41:41,959 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_bdacc6ff-653c-4906-ad13-bbcada100500/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[2862,2875] [2023-11-06 22:41:41,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:41,978 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:41:41,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41 WrapperNode [2023-11-06 22:41:41,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:41,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:41,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:41:41,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:41:41,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,046 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-06 22:41:42,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:42,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:41:42,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:41:42,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:41:42,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:41:42,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:41:42,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:41:42,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:41:42,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (1/1) ... [2023-11-06 22:41:42,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:41:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:42,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:42,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:41:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:41:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 22:41:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 22:41:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 22:41:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 22:41:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:41:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:41:42,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:41:42,272 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:41:42,275 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:41:42,466 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:41:42,472 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:41:42,473 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:41:42,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:42 BoogieIcfgContainer [2023-11-06 22:41:42,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:41:42,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:41:42,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:41:42,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:41:42,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:41:41" (1/3) ... [2023-11-06 22:41:42,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4641f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:41:42, skipping insertion in model container [2023-11-06 22:41:42,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:41" (2/3) ... [2023-11-06 22:41:42,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4641f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:41:42, skipping insertion in model container [2023-11-06 22:41:42,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:42" (3/3) ... [2023-11-06 22:41:42,485 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_6.i [2023-11-06 22:41:42,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:41:42,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:41:42,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:41:42,568 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=LoopsAndPotentialCycles, 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;@38edf259, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:41:42,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:41:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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-06 22:41:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:41:42,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:42,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:42,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:41:42,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 22:41:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416209031] [2023-11-06 22:41:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:42,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:42,955 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-06 22:41:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416209031] [2023-11-06 22:41:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416209031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:42,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:42,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:41:42,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415394459] [2023-11-06 22:41:42,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:42,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:43,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:43,011 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:41:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:43,113 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2023-11-06 22:41:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:41:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:43,131 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:41:43,131 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:41:43,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:43,143 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:43,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 128 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:41:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-06 22:41:43,181 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-06 22:41:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-06 22:41:43,184 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-06 22:41:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:43,184 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-06 22:41:43,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:41:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-06 22:41:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:41:43,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:43,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:43,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:41:43,187 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:41:43,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2023-11-06 22:41:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824525836] [2023-11-06 22:41:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:43,416 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-06 22:41:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824525836] [2023-11-06 22:41:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824525836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:43,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:41:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168325978] [2023-11-06 22:41:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:43,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:41:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:43,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:41:43,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:43,420 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-06 22:41:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:43,525 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-11-06 22:41:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:41:43,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-06 22:41:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:43,527 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:41:43,527 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:41:43,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:43,529 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:43,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:41:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:41:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:41:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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-06 22:41:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-06 22:41:43,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2023-11-06 22:41:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:43,541 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-06 22:41:43,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-06 22:41:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-06 22:41:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:41:43,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:43,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:43,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:41:43,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:41:43,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2023-11-06 22:41:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220853242] [2023-11-06 22:41:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:43,559 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:41:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731911254] [2023-11-06 22:41:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:43,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:43,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:43,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:43,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:41:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:43,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:41:43,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:51,012 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-06 22:41:51,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:04,914 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-06 22:42:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220853242] [2023-11-06 22:42:04,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:42:04,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731911254] [2023-11-06 22:42:04,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731911254] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:04,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:42:04,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-06 22:42:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845119175] [2023-11-06 22:42:04,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:04,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:42:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:42:04,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=185, Unknown=8, NotChecked=0, Total=240 [2023-11-06 22:42:04,930 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-06 22:42:15,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:42:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:15,434 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-11-06 22:42:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:42:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 12 [2023-11-06 22:42:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:15,436 INFO L225 Difference]: With dead ends: 48 [2023-11-06 22:42:15,436 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:42:15,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=122, Invalid=470, Unknown=8, NotChecked=0, Total=600 [2023-11-06 22:42:15,438 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:15,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 304 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-11-06 22:42:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:42:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:42:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-06 22:42:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-06 22:42:15,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2023-11-06 22:42:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:15,448 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-06 22:42:15,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-06 22:42:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-06 22:42:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:42:15,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:15,450 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:15,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:15,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:15,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:15,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1767906835, now seen corresponding path program 2 times [2023-11-06 22:42:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356585581] [2023-11-06 22:42:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:15,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:42:15,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483180334] [2023-11-06 22:42:15,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:42:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:15,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:15,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdacc6ff-653c-4906-ad13-bbcada100500/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:42:15,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:42:15,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:42:15,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:42:15,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:58,788 WARN L839 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (let ((.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse14 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse17 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_17|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse0 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse2 (mod .cse0 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse2))) (let ((.cse3 (mod (+ (* .cse0 255) .cse1) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse0 .cse1) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse2 (+ .cse3 (- 256))) 256)) (<= .cse3 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse6 (mod .cse4 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse6))) (let ((.cse7 (mod (+ (* .cse4 255) .cse5) 256))) (and (<= (mod (+ .cse4 .cse5) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse6 (+ .cse7 (- 256))) 256)) (<= .cse7 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse9) 256))) (and (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse8 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|) (= (mod (mod .cse9 .cse8) 256) |c_ULTIMATE.start_gcd_test_~a#1|))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse15 (mod .cse10 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse15))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse16 (mod (+ (* .cse10 255) .cse11) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse10 .cse11) 256)) (not (= .cse12 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_17| 1) 0) (= .cse13 (mod (+ .cse14 .cse12) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse15 (+ .cse16 (- 256))) 256)) (<= .cse16 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) .cse17) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse20 (mod .cse18 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse20))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse18 .cse19) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse20 (+ (mod (+ (* .cse18 255) .cse19) 256) (- 256))) 256))))))) .cse21) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse25 (mod .cse22 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse25))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse26 (mod (+ (* .cse22 255) .cse23) 256))) (and (<= (mod (+ .cse22 .cse23) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (not (= .cse24 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_17| 1) 0) (= .cse13 (mod (+ .cse14 .cse24) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse25 (+ .cse26 (- 256))) 256)) (<= .cse26 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) .cse17) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse28 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse28) 256))) (and (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse27 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|) (= (mod (mod .cse28 .cse27) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) .cse17) (and .cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse31 (mod .cse29 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse31))) (and (<= (mod (+ .cse29 .cse30) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse31 (+ (mod (+ (* .cse29 255) .cse30) 256) (- 256))) 256)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from false [2023-11-06 22:43:07,256 WARN L839 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (let ((.cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_17|))))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse1) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse0 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|) (= (mod (mod .cse1 .cse0) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse4 (mod .cse2 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse4))) (and (<= (mod (+ .cse2 .cse3) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse4 (+ (mod (+ (* .cse2 255) .cse3) 256) (- 256))) 256))))))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse8 (mod .cse6 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse8))) (let ((.cse9 (mod (+ (* .cse6 255) .cse7) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse6 .cse7) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse8 (+ .cse9 (- 256))) 256)) (<= .cse9 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse12 (mod .cse10 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse12))) (let ((.cse13 (mod (+ (* .cse10 255) .cse11) 256))) (and (<= (mod (+ .cse10 .cse11) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse12 (+ .cse13 (- 256))) 256)) (<= .cse13 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse14 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse16 (mod .cse14 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse16))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse14 .cse15) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse16 (+ (mod (+ (* .cse14 255) .cse15) 256) (- 256))) 256))))))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse18 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18) 256))) (and (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|) (= (mod (mod .cse18 .cse17) 256) |c_ULTIMATE.start_gcd_test_~a#1|))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from false [2023-11-06 22:43:15,183 WARN L839 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (let ((.cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_17|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0))))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse0 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse2 (mod .cse0 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse2))) (and (<= (mod (+ .cse0 .cse1) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (= (mod (mod .cse2 (+ (mod (+ (* .cse0 255) .cse1) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0)))))) .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse5) 256))) (and (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse4 0)) (= (mod (mod .cse5 .cse4) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|))))) (<= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse8 (mod .cse6 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse8))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse6 .cse7) 256)) (= (mod (mod .cse8 (+ (mod (+ (* .cse6 255) .cse7) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0)))))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse11 (mod .cse9 256))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse11))) (let ((.cse12 (mod (+ (* .cse9 255) .cse10) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse9 .cse10) 256)) (= (mod (mod .cse11 (+ .cse12 (- 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (<= .cse12 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256))) (and (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse13 0)) (= (mod (mod .cse14 .cse13) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_#res#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse17 (mod .cse15 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse17))) (let ((.cse18 (mod (+ (* .cse15 255) .cse16) 256))) (and (<= (mod (+ .cse15 .cse16) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (= (mod (mod .cse17 (+ .cse18 (- 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))))))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from false [2023-11-06 22:43:23,347 WARN L839 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (let ((.cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_17|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_main1_~g~0#1|) 256) 0))))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse3 (mod .cse1 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse3))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse1 .cse2) 256)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse3 (+ (mod (+ (* .cse1 255) .cse2) 256) (- 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse6 (mod .cse4 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse6))) (and (<= (mod (+ .cse4 .cse5) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse6 (+ (mod (+ (* .cse4 255) .cse5) 256) (- 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse9 (mod .cse7 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse9))) (let ((.cse10 (mod (+ (* .cse7 255) .cse8) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (<= 128 (mod (+ .cse7 .cse8) 256)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse9 (+ .cse10 (- 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_main1_~g~0#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse12 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse12) 256))) (and (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse11 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (= (mod (mod .cse12 .cse11) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_main1_~g~0#1|) 0))) (and (<= 0 |c_ULTIMATE.start_main1_~g~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|) 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256))) (and (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_17|) (not (= .cse13 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| 127) (= (mod (mod .cse14 .cse13) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_15|))) (let ((.cse17 (mod .cse15 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse17))) (let ((.cse18 (mod (+ (* .cse15 255) .cse16) 256))) (and (<= (mod (+ .cse15 .cse16) 256) 127) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_15|)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse17 (+ .cse18 (- 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_17|)))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_main1_~g~0#1|) 0))))) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from false [2023-11-06 22:43:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 22:43:39,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:07,448 WARN L861 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse19 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse16 (* .cse27 255)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse28 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256)) (.cse30 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse23 (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)))) (let ((.cse34 (mod .cse35 256))) (let ((.cse33 (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256)) (.cse31 (< .cse34 .cse19)) (.cse32 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (or (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse29) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)))))) (and (or .cse31 .cse32 (< .cse33 128)) (or (< 127 .cse33) .cse31 .cse32)))))) (.cse8 (< 0 .cse26))) (let ((.cse12 (< .cse29 128)) (.cse11 (or .cse23 .cse8)) (.cse9 (< 127 .cse29)) (.cse3 (< .cse30 128)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse2 (< 127 .cse30)) (.cse5 (= .cse29 0)) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse28) 256) 0))))) (.cse7 (< .cse28 .cse19)) (.cse20 (mod .cse27 256))) (and (or (let ((.cse4 (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse20)))) (let ((.cse18 (mod .cse17 256))) (let ((.cse14 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse18) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20)))) (.cse15 (< .cse18 .cse19)) (.cse13 (mod (+ .cse16 .cse17) 256))) (and (or (< 127 .cse13) .cse14 .cse15) (or .cse14 .cse15 (< .cse13 128))))))))) (and (or (let ((.cse1 (and .cse4 (or .cse5 .cse6 .cse7 .cse8)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3))) .cse9) (or (let ((.cse10 (and .cse4 .cse11))) (and (or .cse10 .cse0 .cse2) (or .cse10 .cse0 .cse3))) .cse12))) (< .cse20 128)) (or (< 127 .cse20) (let ((.cse22 (= .cse27 0))) (let ((.cse21 (let ((.cse25 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20) 256))) (or (< .cse25 .cse19) (and (<= .cse26 0) (not .cse22)) (= .cse20 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse20))))))) (and (or .cse12 (and (or .cse0 (and .cse11 .cse21) .cse3) (or .cse0 (and (or .cse22 .cse23 .cse8) .cse21) .cse2))) (or .cse9 (let ((.cse24 (and .cse21 (or .cse22 .cse5 .cse6 .cse7 .cse8)))) (and (or .cse24 .cse0 .cse3) (or .cse24 .cse0 .cse2))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) is different from true