./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:12:28,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:12:28,094 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:12:28,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:12:28,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:12:28,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:12:28,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:12:28,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:12:28,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:12:28,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:12:28,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:12:28,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:12:28,136 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:12:28,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:12:28,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:12:28,139 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:12:28,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:12:28,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:12:28,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:12:28,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:12:28,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:12:28,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:12:28,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:12:28,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:12:28,148 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:12:28,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:12:28,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:12:28,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:12:28,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:12:28,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:12:28,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:12:28,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:12:28,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:12:28,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:12:28,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:12:28,153 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:12:28,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:12:28,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:12:28,154 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:12:28,154 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2023-11-06 22:12:28,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:12:28,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:12:28,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:12:28,577 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:12:28,578 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:12:28,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2023-11-06 22:12:31,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:12:32,123 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:12:32,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2023-11-06 22:12:32,139 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/data/a425626d8/35720b930c1e4627b650bca9498d9dd4/FLAG8fa47f45c [2023-11-06 22:12:32,166 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/data/a425626d8/35720b930c1e4627b650bca9498d9dd4 [2023-11-06 22:12:32,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:12:32,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:12:32,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:12:32,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:12:32,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:12:32,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e05b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32, skipping insertion in model container [2023-11-06 22:12:32,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,223 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:12:32,442 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2023-11-06 22:12:32,480 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2023-11-06 22:12:32,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:12:32,493 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:12:32,521 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2023-11-06 22:12:32,539 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2023-11-06 22:12:32,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:12:32,562 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:12:32,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32 WrapperNode [2023-11-06 22:12:32,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:12:32,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:12:32,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:12:32,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:12:32,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,634 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-06 22:12:32,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:12:32,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:12:32,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:12:32,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:12:32,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:12:32,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:12:32,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:12:32,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:12:32,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (1/1) ... [2023-11-06 22:12:32,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:12:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:32,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:12:32,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:12:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 22:12:32,783 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 22:12:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 22:12:32,783 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 22:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:12:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:12:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:12:32,881 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:12:32,885 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:12:33,142 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:12:33,149 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:12:33,150 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:12:33,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:33 BoogieIcfgContainer [2023-11-06 22:12:33,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:12:33,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:12:33,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:12:33,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:12:33,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:32" (1/3) ... [2023-11-06 22:12:33,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21076fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:33, skipping insertion in model container [2023-11-06 22:12:33,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:32" (2/3) ... [2023-11-06 22:12:33,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21076fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:33, skipping insertion in model container [2023-11-06 22:12:33,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:33" (3/3) ... [2023-11-06 22:12:33,163 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2023-11-06 22:12:33,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:12:33,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:12:33,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:12:33,257 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;@7758aaac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:12:33,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:12:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:12:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:12:33,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:33,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:33,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:33,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 22:12:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:33,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854766785] [2023-11-06 22:12:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:33,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854766785] [2023-11-06 22:12:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854766785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:12:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660099027] [2023-11-06 22:12:33,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:33,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:33,725 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:33,885 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2023-11-06 22:12:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:12:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 22:12:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:33,898 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:12:33,898 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:12:33,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:12:33,910 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:33,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:12:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:12:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-11-06 22:12:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:12:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-06 22:12:33,967 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2023-11-06 22:12:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:33,968 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-06 22:12:33,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-06 22:12:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:12:33,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:33,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:33,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:12:33,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:33,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2023-11-06 22:12:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534089068] [2023-11-06 22:12:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:34,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534089068] [2023-11-06 22:12:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534089068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:34,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:12:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826853845] [2023-11-06 22:12:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:34,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:34,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:34,252 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:34,326 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-06 22:12:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:12:34,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 22:12:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:34,329 INFO L225 Difference]: With dead ends: 36 [2023-11-06 22:12:34,330 INFO L226 Difference]: Without dead ends: 30 [2023-11-06 22:12:34,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:12:34,335 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:34,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:12:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-06 22:12:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-06 22:12:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:12:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-06 22:12:34,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2023-11-06 22:12:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:34,353 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-06 22:12:34,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-06 22:12:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:12:34,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:34,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:34,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:12:34,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:34,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2023-11-06 22:12:34,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:34,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297113636] [2023-11-06 22:12:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:34,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:34,396 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:12:34,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486347453] [2023-11-06 22:12:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:34,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:34,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:34,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:12:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:34,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:12:34,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:34,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297113636] [2023-11-06 22:12:34,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:12:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486347453] [2023-11-06 22:12:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486347453] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:34,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:12:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-06 22:12:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691228820] [2023-11-06 22:12:34,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:34,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:12:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:12:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:12:34,684 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2023-11-06 22:12:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:34,778 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-11-06 22:12:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:12:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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 [2023-11-06 22:12:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:34,780 INFO L225 Difference]: With dead ends: 37 [2023-11-06 22:12:34,780 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:12:34,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:12:34,782 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:34,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:12:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:12:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-06 22:12:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:12:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-11-06 22:12:34,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2023-11-06 22:12:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-11-06 22:12:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2023-11-06 22:12:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-11-06 22:12:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:12:34,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:34,791 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:34,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:34,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:34,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:34,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2023-11-06 22:12:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090608849] [2023-11-06 22:12:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:35,009 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:12:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511120255] [2023-11-06 22:12:35,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:12:35,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:35,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:35,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:35,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:12:35,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:12:35,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:35,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:12:35,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:13,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:49,356 WARN L861 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (< 126 |c_ULTIMATE.start_main1_~y~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse16 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse42 (mod .cse7 256)) (.cse41 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse2 (< 127 .cse41)) (.cse17 (< .cse42 128)) (.cse5 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse0 (< 0 .cse16)) (.cse1 (< 127 .cse42)) (.cse3 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0)))) (.cse18 (< .cse41 128))) (and (or .cse0 .cse1 .cse2 .cse3) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse6 .cse7) 256))) (or (< .cse4 .cse5) (< (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse6 256)) (< .cse4 128) (= .cse6 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ .cse9 .cse7) 256))) (or (< .cse8 .cse5) (< (mod .cse9 256) 128) (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse8 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse11 256))) (or (< .cse10 .cse5) (< .cse10 128) (< 127 (mod (+ .cse11 .cse7) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse13 256))) (or (< .cse12 .cse5) (< .cse12 128) (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse13 .cse7) 256) 128))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ .cse14 .cse7) 256))) (or (< (mod .cse14 256) 128) (< (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse15) (< .cse15 .cse16) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (or .cse0 .cse3 .cse17 .cse18) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse20 .cse7) 256))) (or (< .cse19 .cse5) (< 127 (mod .cse20 256)) (< 127 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse19 128) (= .cse20 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse21 .cse7) 256))) (or (< (mod .cse21 256) 128) (< 127 .cse22) (< .cse22 .cse16) (< 127 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod .cse24 256))) (or (< .cse23 .cse16) (< (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse23) (< (mod (+ .cse24 .cse7) 256) 128))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod .cse26 256))) (or (< .cse25 .cse5) (< .cse25 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse26 .cse7) 256) 128))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse28 256))) (or (< .cse27 .cse5) (< .cse27 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse28 .cse7) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse30 256))) (or (< .cse29 .cse16) (< 127 (mod (+ .cse30 .cse7) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse29) (< 127 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod .cse32 256))) (or (< .cse31 .cse16) (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse32 .cse7) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse31))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 .cse7) 256))) (or (< (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse34) (< .cse34 .cse16) (< 127 (mod .cse33 256)) (= .cse33 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (or .cse0 .cse2 .cse3 .cse17) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse7) 256))) (or (< 127 .cse35) (< .cse35 .cse16) (< 127 (mod .cse36 256)) (< 127 (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse36 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 .cse7) 256))) (or (< .cse37 .cse5) (< (mod .cse38 256) 128) (< 127 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse37 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod .cse40 256))) (or (< .cse39 .cse16) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse39) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse40 .cse7) 256) 128))))) (or .cse0 .cse1 .cse3 .cse18)))))) is different from true [2023-11-06 22:13:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:51,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090608849] [2023-11-06 22:13:51,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:13:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511120255] [2023-11-06 22:13:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511120255] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:51,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:13:51,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-06 22:13:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136412063] [2023-11-06 22:13:51,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:51,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:13:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:13:51,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=163, Unknown=12, NotChecked=26, Total=240 [2023-11-06 22:13:51,020 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:04,663 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, 1] [2023-11-06 22:14:06,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:14:08,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:14:10,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:14:12,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:14:30,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:14:43,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:14:45,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:14:47,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:14:50,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:14:52,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:14:54,838 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse28 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse86 (* v_y_12 256)) (.cse87 (* v_z_12 255))) (let ((.cse84 (+ .cse86 .cse87)) (.cse85 (+ .cse86 .cse87 (* v_y_11 256)))) (and (<= .cse84 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse85) 0) (<= 0 .cse84) (<= .cse85 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse85) (<= v_z_12 255)))))) (.cse17 (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse82 (* 255 v_z_3)) (.cse83 (* 256 v_y_3))) (let ((.cse80 (+ .cse82 (* 256 v_y_2) .cse83)) (.cse81 (+ .cse82 .cse83))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse80) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse80) (<= .cse81 255) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse81)))))) (.cse31 (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse78 (* 256 v_y_9)) (.cse79 (* 255 v_z_9))) (let ((.cse76 (+ .cse78 .cse79)) (.cse77 (+ .cse78 .cse79 (* 256 v_y_7)))) (and (<= 128 .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse77) 0) (<= .cse76 255) (<= 0 v_z_9) (<= 0 .cse77) (<= v_z_9 127)))))) (.cse3 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse74 (* 256 v_y_6)) (.cse75 (* 255 v_z_6))) (let ((.cse73 (+ (* 256 v_y_4) .cse74 .cse75)) (.cse72 (+ .cse74 .cse75))) (and (<= .cse72 127) (<= v_z_6 127) (<= .cse73 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse73 0)) (<= 0 .cse73) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse73) 0) (<= 0 .cse72))))))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse2 (<= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse1 (mod .cse0 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse1 127) (<= 128 (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (and .cse2 .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse5 (mod .cse6 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse5))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse8 (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse7 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse8) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse7 256) 127) (<= .cse8 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse9 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse9) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse9 127) (<= 128 (mod .cse10 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse11 (mod .cse12 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse11) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse11))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse14 (mod .cse13 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse14) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse14 127) (<= 128 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse15 (mod .cse16 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse15) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse15))))) (and .cse2 .cse17) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse18 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse18) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse19 256) 127) (<= 128 .cse18) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse21 (mod .cse20 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse20 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse21) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse21 127) (<= (mod (+ .cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse22 (mod .cse23 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse22) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse22))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse25 (mod .cse24 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse24 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse25 127) (<= (mod (+ .cse24 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse27 (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse26 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse27) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse26 256) 127) (<= .cse27 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse2 .cse28) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse29 (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse29) (not (= .cse30 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse30 256) 127) (<= 128 .cse29) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse31 .cse2) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse32 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse32) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse32) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse33 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse34 (mod (+ .cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse34) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse35 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse34) (<= 128 (mod .cse35 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse36 (mod (+ .cse37 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse36) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse37 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse36 127) (<= 128 (mod .cse37 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))))) (let ((.cse42 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse47 (<= |c_ULTIMATE.start_gcd_test_#res#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse39 (mod (+ .cse38 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse39 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse39) (<= 128 (mod .cse38 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse41 (mod (+ .cse40 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse40 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse40 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse40 256) 127) (<= 128 .cse41) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse41))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse44 (mod .cse43 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse43 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse44 127) (<= 128 (mod (+ .cse43 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse44))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse46 (mod (+ .cse45 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse45 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse45 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse45 256) 127) (<= .cse46 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse46) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse28 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse49 (mod (+ .cse48 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse48 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse49 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse49) (<= 128 (mod .cse48 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse51 (mod (+ .cse50 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse50 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse50 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse50 256) 127) (<= .cse51 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse51) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse53 (mod (+ .cse52 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse52 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse53) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse52 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse53))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse55 (mod .cse54 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse54 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse55 127) (<= (mod (+ .cse54 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse55))))) (and .cse17 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse57 (mod .cse56 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse56 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse57) (<= 128 (mod (+ .cse56 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse57))))) (and .cse31 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse59 (mod (+ .cse58 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse58 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse58 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse58 256) 127) (<= 128 .cse59) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse59))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse61 (mod .cse60 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse60 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse61) (<= 128 (mod (+ .cse60 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse61))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse63 (mod .cse62 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse62 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse63 127) (<= 128 (mod (+ .cse62 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse63))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse65 (mod (+ .cse64 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse64 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse65) (<= 128 (mod .cse64 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse65))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse67 (mod .cse66 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse66 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse67) (<= (mod (+ .cse66 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse67))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse69 (mod .cse68 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse68 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse69) (<= (mod (+ .cse68 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse69))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse71 (mod .cse70 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse70 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse71 127) (<= (mod (+ .cse70 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse71))))) (and .cse3 .cse47))))) is different from false [2023-11-06 22:15:09,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:15:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:24,678 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-06 22:15:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:15:24,679 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 [2023-11-06 22:15:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:24,680 INFO L225 Difference]: With dead ends: 43 [2023-11-06 22:15:24,680 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:15:24,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 112.5s TimeCoverageRelationStatistics Valid=91, Invalid=397, Unknown=26, NotChecked=86, Total=600 [2023-11-06 22:15:24,682 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:24,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 226 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 10 Unknown, 54 Unchecked, 29.3s Time] [2023-11-06 22:15:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:15:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:15:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:15:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-11-06 22:15:24,702 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2023-11-06 22:15:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:24,703 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-06 22:15:24,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-11-06 22:15:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:15:24,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:24,705 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:24,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:15:24,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:24,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:24,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 3 times [2023-11-06 22:15:24,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:24,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607667369] [2023-11-06 22:15:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:24,917 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:15:24,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553811166] [2023-11-06 22:15:24,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:15:24,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:24,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:24,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:15:24,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9404dd-c5c1-42ff-a405-0578a1397651/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:15:25,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:15:25,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:15:25,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:15:25,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:15:30,044 WARN L861 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (or (and (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse2 (mod .cse4 256))) (or (and .cse0 .cse1 (<= 128 .cse2)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse3 (mod .cse5 256))) (and (<= .cse3 127) (<= (mod (+ .cse4 .cse5) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse3 |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse7 (mod .cse6 256))) (and (<= 128 (mod (+ .cse4 .cse6) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse7 .cse8) (<= 128 .cse7))))) (and (<= .cse2 127) .cse0 .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse9 (mod .cse10 256))) (and (<= .cse9 127) (<= 128 (mod (+ .cse4 .cse10) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse9 |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse12 (mod .cse11 256))) (and (<= (mod (+ .cse4 .cse11) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse12 .cse8) (<= 128 .cse12)))))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (and (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (and .cse0 .cse1 (<= .cse13 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse14 (mod .cse15 256))) (and (<= .cse14 127) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse14 |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse17 (mod .cse16 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse16) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse17 .cse8) (<= 128 .cse17))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse18 (mod .cse19 256))) (and (<= .cse18 127) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse19) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse18 |c_ULTIMATE.start_gcd_test_~b#1|))))) (and (<= 128 .cse13) .cse0 .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse21 (mod .cse20 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse20) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse21 .cse8) (<= 128 .cse21))))))) (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse23 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse24 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256) 127) (= .cse23 (mod (+ .cse22 .cse24) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (not (= .cse22 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse25 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse25) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse23 (mod (+ .cse26 .cse24) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse27 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse27) 256) 127))))))) is different from true [2023-11-06 22:16:48,736 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse6 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (+ (- 256) (mod (+ .cse1 .cse6) 256)))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse5))) (let ((.cse3 (mod .cse2 256))) (let ((.cse0 (mod .cse5 .cse3))) (and (not (= .cse0 0)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 127) (<= (mod (+ .cse0 .cse2) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (not (= .cse3 0)) (= (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse4 (mod (+ (* .cse2 255) .cse0) 256)) (not (= .cse1 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (+ (- 256) (mod (+ .cse8 .cse6) 256)))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11))) (let ((.cse7 (mod .cse10 256))) (let ((.cse9 (mod .cse11 .cse7))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (not (= .cse7 0)) (= (mod (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= 128 (mod (+ .cse9 .cse10) 256)) (= .cse4 (mod (+ (* .cse10 255) .cse9) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse16 (+ (- 256) (mod (+ .cse12 .cse6) 256)))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16))) (let ((.cse13 (mod .cse15 256))) (let ((.cse14 (mod .cse16 .cse13))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (not (= .cse13 0)) (= (mod (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= 128 (mod (+ .cse14 .cse15) 256)) (= .cse4 (mod (+ (* .cse15 255) .cse14) 256)) (not (= .cse12 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (+ (- 256) (mod (+ .cse20 .cse6) 256)))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse21))) (let ((.cse19 (mod .cse18 256))) (let ((.cse17 (mod .cse21 .cse19))) (and (not (= .cse17 0)) (<= (mod (+ .cse17 .cse18) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (not (= .cse19 0)) (= (mod (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse4 (mod (+ (* .cse18 255) .cse17) 256)))))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse24 (mod .cse23 256))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod (mod .cse22 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (not (= .cse22 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod .cse24 .cse22) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse27 (mod .cse26 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256) 127) (not (= .cse25 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod .cse27 .cse25) 256) |c_ULTIMATE.start_gcd_test_~a#1|))))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false