./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8 --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 29d96db4a6009ca50700370626b51b87675af883de25c8c867b510f89e0e2698 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:40:01,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:40:01,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:40:01,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:40:01,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:40:01,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:40:01,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:40:01,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:40:01,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:40:01,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:40:01,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:40:01,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:40:01,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:40:01,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:40:01,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:40:01,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:40:01,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:40:01,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:40:01,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:40:01,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:40:01,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:40:01,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:40:01,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:40:01,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:40:01,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:40:01,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:40:01,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:40:01,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:40:01,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:40:01,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:40:01,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:40:01,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:40:01,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:40:01,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:40:01,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:40:01,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:40:01,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:40:01,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:40:01,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:40:01,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:40:01,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:40:01,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:40:01,880 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:40:01,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:40:01,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:40:01,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:40:01,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:40:01,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:40:01,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:40:01,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:40:01,888 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:40:01,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:40:01,889 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:40:01,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:40:01,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:40:01,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:40:01,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:40:01,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:40:01,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:40:01,890 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:40:01,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:40:01,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:40:01,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:40:01,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:40:01,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:40:01,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:40:01,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:40:01,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:40:01,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:40:01,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:40:01,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:40:01,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:40:01,892 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:40:01,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:40:01,892 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:40:01,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:40:01,893 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:40:01,893 INFO L138 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_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/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_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8 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 -> 29d96db4a6009ca50700370626b51b87675af883de25c8c867b510f89e0e2698 [2022-12-13 16:40:02,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:40:02,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:40:02,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:40:02,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:40:02,086 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:40:02,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i [2022-12-13 16:40:04,702 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:40:04,851 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:40:04,851 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i [2022-12-13 16:40:04,855 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/data/c90d3ee5f/a8ce9293fc614274b26e1a40fcf86b32/FLAG744b09e59 [2022-12-13 16:40:04,866 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/data/c90d3ee5f/a8ce9293fc614274b26e1a40fcf86b32 [2022-12-13 16:40:04,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:40:04,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:40:04,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:40:04,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:40:04,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:40:04,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:40:04" (1/1) ... [2022-12-13 16:40:04,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c97f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:04, skipping insertion in model container [2022-12-13 16:40:04,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:40:04" (1/1) ... [2022-12-13 16:40:04,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:40:04,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:40:04,992 WARN L237 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_858bd48f-898f-43c5-8a48-58936f9f5ac9/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[1226,1239] [2022-12-13 16:40:05,007 WARN L237 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_858bd48f-898f-43c5-8a48-58936f9f5ac9/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[2828,2841] [2022-12-13 16:40:05,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:40:05,016 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:40:05,025 WARN L237 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_858bd48f-898f-43c5-8a48-58936f9f5ac9/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[1226,1239] [2022-12-13 16:40:05,031 WARN L237 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_858bd48f-898f-43c5-8a48-58936f9f5ac9/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[2828,2841] [2022-12-13 16:40:05,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:40:05,043 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:40:05,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05 WrapperNode [2022-12-13 16:40:05,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:40:05,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:40:05,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:40:05,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:40:05,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,070 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-12-13 16:40:05,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:40:05,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:40:05,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:40:05,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:40:05,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,086 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:40:05,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:40:05,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:40:05,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:40:05,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (1/1) ... [2022-12-13 16:40:05,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:40:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:40:05,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:40:05,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:40:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:40:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-12-13 16:40:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-12-13 16:40:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-12-13 16:40:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-12-13 16:40:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:40:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:40:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:40:05,195 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:40:05,196 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:40:05,322 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:40:05,326 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:40:05,327 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 16:40:05,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:40:05 BoogieIcfgContainer [2022-12-13 16:40:05,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:40:05,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:40:05,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:40:05,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:40:05,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:40:04" (1/3) ... [2022-12-13 16:40:05,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:40:05, skipping insertion in model container [2022-12-13 16:40:05,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:40:05" (2/3) ... [2022-12-13 16:40:05,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:40:05, skipping insertion in model container [2022-12-13 16:40:05,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:40:05" (3/3) ... [2022-12-13 16:40:05,334 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_2.i [2022-12-13 16:40:05,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:40:05,348 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:40:05,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:40:05,389 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;@4eb472b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:40:05,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 16:40:05,392 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) [2022-12-13 16:40:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 16:40:05,400 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:40:05,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:40:05,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:40:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:40:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-12-13 16:40:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:40:05,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87322704] [2022-12-13 16:40:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:40:05,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 16:40:05,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282000480] [2022-12-13 16:40:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:05,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:40:05,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:40:05,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:40:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:40:05,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:40:05,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:40:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:40:05,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:40:05,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:40:05,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87322704] [2022-12-13 16:40:05,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 16:40:05,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282000480] [2022-12-13 16:40:05,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282000480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:40:05,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:40:05,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:40:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848443926] [2022-12-13 16:40:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:40:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:40:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:40:05,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:40:05,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:40:05,594 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2022-12-13 16:40:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:40:05,610 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-12-13 16:40:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:40:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 [2022-12-13 16:40:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:40:05,617 INFO L225 Difference]: With dead ends: 72 [2022-12-13 16:40:05,617 INFO L226 Difference]: Without dead ends: 32 [2022-12-13 16:40:05,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:40:05,622 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:40:05,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:40:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-13 16:40:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-13 16:40:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 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) [2022-12-13 16:40:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-12-13 16:40:05,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-12-13 16:40:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:40:05,649 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-12-13 16:40:05,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2022-12-13 16:40:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-12-13 16:40:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 16:40:05,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:40:05,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:40:05,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:40:05,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:05,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:40:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:40:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-12-13 16:40:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:40:05,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839703428] [2022-12-13 16:40:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:40:05,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 16:40:05,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122180747] [2022-12-13 16:40:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:05,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:40:05,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:40:05,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:40:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:40:06,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:40:06,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:40:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:40:06,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:40:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:40:06,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839703428] [2022-12-13 16:40:06,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 16:40:06,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122180747] [2022-12-13 16:40:06,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122180747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:40:06,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:40:06,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:40:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747697895] [2022-12-13 16:40:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:40:06,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:40:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:40:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:40:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:40:06,059 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-12-13 16:40:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:40:06,070 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-12-13 16:40:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:40:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2022-12-13 16:40:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:40:06,072 INFO L225 Difference]: With dead ends: 39 [2022-12-13 16:40:06,072 INFO L226 Difference]: Without dead ends: 33 [2022-12-13 16:40:06,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:40:06,073 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:40:06,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:40:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-13 16:40:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-13 16:40:06,078 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) [2022-12-13 16:40:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-12-13 16:40:06,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-12-13 16:40:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:40:06,079 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-12-13 16:40:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-12-13 16:40:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-12-13 16:40:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 16:40:06,080 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:40:06,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:40:06,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 16:40:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:06,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:40:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:40:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-12-13 16:40:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:40:06,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586810066] [2022-12-13 16:40:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:40:06,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 16:40:06,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108103805] [2022-12-13 16:40:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:40:06,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:40:06,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:40:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:40:06,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 16:40:06,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:40:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:40:06,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:40:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:40:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:40:06,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586810066] [2022-12-13 16:40:06,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 16:40:06,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108103805] [2022-12-13 16:40:06,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108103805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:40:06,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:40:06,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-12-13 16:40:06,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702897614] [2022-12-13 16:40:06,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:40:06,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:40:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:40:06,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:40:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:40:06,473 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-12-13 16:40:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:40:06,525 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-12-13 16:40:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:40:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 [2022-12-13 16:40:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:40:06,526 INFO L225 Difference]: With dead ends: 39 [2022-12-13 16:40:06,526 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 16:40:06,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:40:06,528 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:40:06,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:40:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 16:40:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 16:40:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2022-12-13 16:40:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-12-13 16:40:06,534 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-12-13 16:40:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:40:06,534 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-12-13 16:40:06,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-12-13 16:40:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-12-13 16:40:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:40:06,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:40:06,535 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:40:06,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:40:06,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:06,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:40:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:40:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-12-13 16:40:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:40:06,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924021130] [2022-12-13 16:40:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:40:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:40:06,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 16:40:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944967016] [2022-12-13 16:40:06,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:40:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:40:06,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:40:06,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:40:06,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:40:15,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:40:15,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:40:15,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 16:40:15,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:41:01,492 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-13 16:41:19,486 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-13 16:41:40,048 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse0 |c_ULTIMATE.start_gcd_test_#res#1|) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-12-13 16:41:51,968 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 16:41:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 16:41:51,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:45:49,407 WARN L233 SmtUtils]: Spent 2.89m on a formula simplification that was a NOOP. DAG size: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:46:57,795 WARN L233 SmtUtils]: Spent 45.47s on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:47:22,789 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:48:21,963 WARN L233 SmtUtils]: Spent 23.92s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:49:12,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_5|) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (= .cse0 0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256) 0)) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_5|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0)))) is different from false [2022-12-13 16:49:14,057 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_5|) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (= .cse0 0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256) 0)) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_5|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0)))) is different from true [2022-12-13 16:49:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:49:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:49:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924021130] [2022-12-13 16:49:34,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 16:49:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944967016] [2022-12-13 16:49:34,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944967016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:49:34,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:49:34,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2022-12-13 16:49:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360090558] [2022-12-13 16:49:34,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:49:34,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 16:49:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:49:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 16:49:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=130, Unknown=27, NotChecked=108, Total=306 [2022-12-13 16:49:34,300 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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) [2022-12-13 16:50:24,465 WARN L233 SmtUtils]: Spent 42.20s on a formula simplification. DAG size of input: 45 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:50:27,417 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse0 (<= .cse2 127))) (and (let ((.cse1 (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse0) (= 0 .cse1) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)))) (let ((.cse3 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse0 (= .cse3 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= .cse6 127))) (and (let ((.cse4 (mod (+ .cse6 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse5 (= .cse4 0))) (let ((.cse7 (mod (mod .cse6 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse5) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 0)) (= .cse7 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from false [2022-12-13 16:50:29,420 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse0 (<= .cse2 127))) (and (let ((.cse1 (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse0) (= 0 .cse1) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)))) (let ((.cse3 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse0 (= .cse3 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= .cse6 127))) (and (let ((.cse4 (mod (+ .cse6 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse5 (= .cse4 0))) (let ((.cse7 (mod (mod .cse6 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse5) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 0)) (= .cse7 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from true [2022-12-13 16:51:53,758 WARN L233 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 83 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:51:55,786 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] [2022-12-13 16:51:57,793 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] [2022-12-13 16:51:59,797 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] [2022-12-13 16:52:21,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-13 16:52:23,399 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] [2022-12-13 16:52:25,403 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] [2022-12-13 16:52:27,437 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse0 127) (= (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse2 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (let ((.cse1 (mod (+ (- 256) .cse2) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 0) (not (<= .cse2 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) (< 0 |c_ULTIMATE.start_gcd_test_~a#1|)) is different from false [2022-12-13 16:52:29,787 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-13 16:52:31,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from false [2022-12-13 16:52:33,826 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from true [2022-12-13 16:52:34,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-13 16:52:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:52:34,844 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-12-13 16:52:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:52:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 13 [2022-12-13 16:52:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:52:34,848 INFO L225 Difference]: With dead ends: 43 [2022-12-13 16:52:34,848 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 16:52:34,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 493.6s TimeCoverageRelationStatistics Valid=60, Invalid=172, Unknown=40, NotChecked=280, Total=552 [2022-12-13 16:52:34,849 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:52:34,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 413 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 5 Unknown, 78 Unchecked, 13.6s Time] [2022-12-13 16:52:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 16:52:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-12-13 16:52:34,853 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) [2022-12-13 16:52:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-12-13 16:52:34,854 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2022-12-13 16:52:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:52:34,854 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-12-13 16:52:34,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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) [2022-12-13 16:52:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-12-13 16:52:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 16:52:34,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:52:34,855 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:52:34,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:52:35,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:52:35,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:52:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:52:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 403427572, now seen corresponding path program 1 times [2022-12-13 16:52:35,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:52:35,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103221882] [2022-12-13 16:52:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:52:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:52:35,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 16:52:35,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650431769] [2022-12-13 16:52:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:52:35,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:52:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:52:35,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:52:35,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858bd48f-898f-43c5-8a48-58936f9f5ac9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:52:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:52:35,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 16:52:35,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:52:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:52:35,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:53:18,199 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (<= .cse29 127)) (.cse3 (<= .cse28 127)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse28) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse24 (= .cse28 0)) (.cse25 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse26 (= .cse29 0)) (.cse12 (not .cse16)) (.cse17 (mod .cse27 256))) (let ((.cse18 (<= .cse17 127)) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse29)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse6 (or .cse25 .cse26 .cse12)) (.cse14 (or .cse22 .cse12 .cse24)) (.cse0 (not .cse3)) (.cse8 (not .cse9)) (.cse13 (not .cse5)) (.cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (and (or (let ((.cse7 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))))) (let ((.cse4 (or (and .cse7 (or .cse15 .cse12)) .cse13)) (.cse2 (or .cse13 (and .cse14 .cse7)))) (and (or (let ((.cse1 (or .cse5 (and .cse6 .cse7)))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and .cse4 .cse1)))) .cse8) (or .cse9 (let ((.cse10 (or .cse5 (and (or .cse11 .cse12) .cse7)))) (and (or (and .cse4 .cse10) .cse3) (or .cse0 (and .cse10 .cse2)))))))) .cse18) (or (not .cse18) (let ((.cse21 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (= .cse17 0))) (.cse23 (= .cse27 0))) (let ((.cse20 (or .cse13 (and .cse21 (or .cse23 .cse15 .cse12))))) (and (or (let ((.cse19 (or .cse5 (and .cse21 (or .cse23 .cse11 .cse12))))) (and (or .cse3 (and .cse19 .cse20)) (or .cse0 (and (or (and .cse21 (or .cse22 .cse23 .cse12 .cse24)) .cse13) .cse19)))) .cse9) (or (and (or (and .cse20 (or .cse5 (and (or .cse23 .cse25 .cse26 .cse12) .cse21))) .cse3) (or (and (or (and .cse6 .cse21) .cse5) (or .cse13 (and .cse21 .cse14))) .cse0)) .cse8)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-12-13 16:55:29,609 WARN L233 SmtUtils]: Spent 2.03m on a formula simplification. DAG size of input: 62 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:55:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 16:55:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:29,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103221882] [2022-12-13 16:55:29,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 16:55:29,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650431769] [2022-12-13 16:55:29,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650431769] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:55:29,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:55:29,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2022-12-13 16:55:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807877307] [2022-12-13 16:55:29,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:55:29,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:55:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:55:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2022-12-13 16:55:29,633 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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)