./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 de6f52d29ab8cbb588307c65427c40feccf3bbab41549d766ad7ad11f97b3a0b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 08:39:51,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 08:39:51,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 08:39:51,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 08:39:51,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 08:39:51,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 08:39:51,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 08:39:51,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 08:39:51,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 08:39:51,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 08:39:51,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 08:39:51,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 08:39:51,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 08:39:51,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 08:39:51,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 08:39:51,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 08:39:51,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 08:39:51,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 08:39:51,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 08:39:51,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 08:39:51,571 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 08:39:51,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 08:39:51,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 08:39:51,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 08:39:51,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 08:39:51,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 08:39:51,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 08:39:51,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 08:39:51,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 08:39:51,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 08:39:51,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 08:39:51,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 08:39:51,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 08:39:51,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 08:39:51,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 08:39:51,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 08:39:51,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 08:39:51,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 08:39:51,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 08:39:51,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 08:39:51,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 08:39:51,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 08:39:51,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 08:39:51,623 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 08:39:51,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 08:39:51,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 08:39:51,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 08:39:51,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 08:39:51,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 08:39:51,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 08:39:51,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 08:39:51,626 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 08:39:51,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 08:39:51,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 08:39:51,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 08:39:51,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 08:39:51,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 08:39:51,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 08:39:51,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 08:39:51,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 08:39:51,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 08:39:51,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 08:39:51,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 08:39:51,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 08:39:51,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 08:39:51,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 08:39:51,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 08:39:51,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 08:39:51,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 08:39:51,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 08:39:51,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 08:39:51,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 08:39:51,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 08:39:51,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 08:39:51,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 08:39:51,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 08:39:51,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> de6f52d29ab8cbb588307c65427c40feccf3bbab41549d766ad7ad11f97b3a0b [2022-07-12 08:39:51,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 08:39:51,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 08:39:51,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 08:39:51,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 08:39:51,886 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 08:39:51,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i [2022-07-12 08:39:51,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cee455f/71074d093cd14865947d95e60e5de228/FLAGcbe2a8bd8 [2022-07-12 08:39:52,309 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 08:39:52,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i [2022-07-12 08:39:52,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cee455f/71074d093cd14865947d95e60e5de228/FLAGcbe2a8bd8 [2022-07-12 08:39:52,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cee455f/71074d093cd14865947d95e60e5de228 [2022-07-12 08:39:52,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 08:39:52,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 08:39:52,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 08:39:52,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 08:39:52,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 08:39:52,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c11f7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52, skipping insertion in model container [2022-07-12 08:39:52,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 08:39:52,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 08:39:52,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[1226,1239] [2022-07-12 08:39:52,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[2841,2854] [2022-07-12 08:39:52,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 08:39:52,904 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 08:39:52,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[1226,1239] [2022-07-12 08:39:52,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[2841,2854] [2022-07-12 08:39:52,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 08:39:52,935 INFO L208 MainTranslator]: Completed translation [2022-07-12 08:39:52,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52 WrapperNode [2022-07-12 08:39:52,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 08:39:52,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 08:39:52,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 08:39:52,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 08:39:52,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,967 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-07-12 08:39:52,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 08:39:52,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 08:39:52,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 08:39:52,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 08:39:52,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:52,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 08:39:52,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 08:39:52,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 08:39:52,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 08:39:52,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (1/1) ... [2022-07-12 08:39:53,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 08:39:53,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:39:53,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 08:39:53,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 08:39:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 08:39:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-07-12 08:39:53,057 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-07-12 08:39:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-07-12 08:39:53,057 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-07-12 08:39:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 08:39:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 08:39:53,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 08:39:53,110 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 08:39:53,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 08:39:53,285 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 08:39:53,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 08:39:53,295 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 08:39:53,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 08:39:53 BoogieIcfgContainer [2022-07-12 08:39:53,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 08:39:53,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 08:39:53,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 08:39:53,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 08:39:53,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 08:39:52" (1/3) ... [2022-07-12 08:39:53,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0f60c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 08:39:53, skipping insertion in model container [2022-07-12 08:39:53,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 08:39:52" (2/3) ... [2022-07-12 08:39:53,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0f60c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 08:39:53, skipping insertion in model container [2022-07-12 08:39:53,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 08:39:53" (3/3) ... [2022-07-12 08:39:53,304 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_5.i [2022-07-12 08:39:53,316 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 08:39:53,317 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 08:39:53,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 08:39:53,383 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@331f652, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@335a098b [2022-07-12 08:39:53,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 08:39:53,397 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) [2022-07-12 08:39:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 08:39:53,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:39:53,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 08:39:53,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:39:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:39:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-07-12 08:39:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:39:53,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42094800] [2022-07-12 08:39:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:39:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:39:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:39:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 08:39:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:39:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42094800] [2022-07-12 08:39:53,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42094800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:39:53,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:39:53,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 08:39:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460850150] [2022-07-12 08:39:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:39:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 08:39:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:39:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 08:39:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 08:39:53,704 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) [2022-07-12 08:39:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:39:53,775 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-07-12 08:39:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 08:39:53,777 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 [2022-07-12 08:39:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:39:53,781 INFO L225 Difference]: With dead ends: 90 [2022-07-12 08:39:53,781 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 08:39:53,783 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 [2022-07-12 08:39:53,786 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 08:39:53,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:39:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 08:39:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-07-12 08:39:53,815 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) [2022-07-12 08:39:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-12 08:39:53,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-07-12 08:39:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:39:53,817 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-12 08:39:53,818 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) [2022-07-12 08:39:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-12 08:39:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 08:39:53,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:39:53,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 08:39:53,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 08:39:53,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:39:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:39:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-07-12 08:39:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:39:53,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856723426] [2022-07-12 08:39:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:39:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:39:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:39:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 08:39:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:39:53,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856723426] [2022-07-12 08:39:53,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856723426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 08:39:53,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 08:39:53,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 08:39:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609062293] [2022-07-12 08:39:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 08:39:53,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 08:39:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:39:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 08:39:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 08:39:53,860 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) [2022-07-12 08:39:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:39:53,883 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-07-12 08:39:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 08:39:53,884 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 [2022-07-12 08:39:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:39:53,885 INFO L225 Difference]: With dead ends: 36 [2022-07-12 08:39:53,885 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 08:39:53,885 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 [2022-07-12 08:39:53,886 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 08:39:53,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:39:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 08:39:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 08:39:53,892 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) [2022-07-12 08:39:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-12 08:39:53,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-07-12 08:39:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:39:53,893 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-12 08:39:53,894 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) [2022-07-12 08:39:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-12 08:39:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 08:39:53,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:39:53,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 08:39:53,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 08:39:53,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:39:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:39:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-07-12 08:39:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:39:53,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143450346] [2022-07-12 08:39:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:39:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:39:53,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 08:39:53,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103569842] [2022-07-12 08:39:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:39:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:39:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:39:53,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 08:39:53,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 08:39:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 08:39:53,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 08:39:53,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:39:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 08:39:54,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 08:39:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 08:39:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:39:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143450346] [2022-07-12 08:39:54,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 08:39:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103569842] [2022-07-12 08:39:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103569842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 08:39:54,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 08:39:54,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-12 08:39:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947638173] [2022-07-12 08:39:54,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 08:39:54,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 08:39:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:39:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 08:39:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 08:39:54,118 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 08:39:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:39:54,195 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-07-12 08:39:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 08:39:54,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 08:39:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:39:54,196 INFO L225 Difference]: With dead ends: 37 [2022-07-12 08:39:54,196 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 08:39:54,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-12 08:39:54,198 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 08:39:54,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 08:39:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 08:39:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 08:39:54,202 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) [2022-07-12 08:39:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-07-12 08:39:54,203 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-07-12 08:39:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:39:54,203 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-07-12 08:39:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 08:39:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-07-12 08:39:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 08:39:54,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:39:54,205 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 08:39:54,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 08:39:54,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:39:54,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:39:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:39:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-07-12 08:39:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:39:54,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984475666] [2022-07-12 08:39:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:39:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:39:54,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 08:39:54,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140922221] [2022-07-12 08:39:54,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 08:39:54,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:39:54,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:39:54,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 08:39:54,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 08:39:54,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 08:39:54,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 08:39:54,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 08:39:54,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:40:03,936 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:40:31,969 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:40:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 08:40:32,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 08:40:41,965 WARN L855 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~y~0#1| 0) (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse3 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse30) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse30 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (.cse4 (not .cse0)) (.cse5 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (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 ((.cse29 (mod .cse28 256))) (or (not (<= (mod (+ .cse28 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse29) 256) 0)) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse29 |c_ULTIMATE.start_main1_~y~0#1|))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse1 127)) (<= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod .cse2 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse1) 256) 0)) (<= (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (or .cse0 .cse3) (or .cse4 (and .cse5 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= .cse6 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse6 127)) (< 127 (mod (+ .cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (< 127 (mod .cse7 256)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse6) 256) 0)))))))))) (or .cse4 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|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 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse8 127)) (<= (mod .cse9 256) 127) (< 127 (mod (+ .cse9 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse8) 256) 0))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse10 256))) (or (not (<= (mod (+ .cse10 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse11) 256) 0)) (not (<= .cse11 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (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 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse12 127)) (<= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse12) 256) 0)) (not (<= (mod .cse13 256) 127)) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse13 0))))))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse15 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse15 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse14 |c_ULTIMATE.start_main1_~y~0#1|)))))) (or .cse4 .cse3) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse16 127)) (<= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod .cse17 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse16) 256) 0)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))) .cse0) (or .cse4 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= .cse18 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse18 127)) (<= (mod (+ .cse19 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (<= (mod .cse19 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18) 256) 0))))))) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (or (not (<= (mod (+ .cse20 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse21) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse21 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) .cse4) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse23 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse22) 256) 0)) (not (<= (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse23 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse24 127)) (<= (mod (+ .cse25 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= (mod .cse25 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse24) 256) 0)) (= .cse25 0)))))))) .cse4) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse26 127)) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse26) 256) 0)) (< 127 (mod .cse27 256)) (< 127 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))))) .cse5) .cse0)))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-07-12 08:41:24,847 WARN L233 SmtUtils]: Spent 36.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:41:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 08:41:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 08:41:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984475666] [2022-07-12 08:41:26,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 08:41:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140922221] [2022-07-12 08:41:26,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140922221] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 08:41:26,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 08:41:26,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-12 08:41:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653127127] [2022-07-12 08:41:26,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 08:41:26,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 08:41:26,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 08:41:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 08:41:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=191, Unknown=7, NotChecked=28, Total=272 [2022-07-12 08:41:26,539 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 08:41:36,959 WARN L233 SmtUtils]: Spent 9.41s on a formula simplification. DAG size of input: 116 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:41:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 08:41:37,254 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-12 08:41:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 08:41:37,255 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 08:41:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 08:41:37,256 INFO L225 Difference]: With dead ends: 40 [2022-07-12 08:41:37,256 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 08:41:37,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 90.4s TimeCoverageRelationStatistics Valid=68, Invalid=271, Unknown=7, NotChecked=34, Total=380 [2022-07-12 08:41:37,258 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 08:41:37,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-07-12 08:41:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 08:41:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-12 08:41:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2022-07-12 08:41:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-07-12 08:41:37,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-07-12 08:41:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 08:41:37,264 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-07-12 08:41:37,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 08:41:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-07-12 08:41:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 08:41:37,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 08:41:37,266 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 08:41:37,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 08:41:37,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 08:41:37,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 08:41:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 08:41:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-07-12 08:41:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 08:41:37,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352331305] [2022-07-12 08:41:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 08:41:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 08:41:37,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 08:41:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535184854] [2022-07-12 08:41:37,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 08:41:37,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 08:41:37,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 08:41:37,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 08:41:37,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 08:41:37,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 08:41:37,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 08:41:37,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 08:41:37,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 08:42:10,173 WARN L233 SmtUtils]: Spent 22.09s on a formula simplification. DAG size of input: 64 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:42:25,800 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse38 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (< 127 (mod (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (.cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse37 127)) (= .cse37 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))) (.cse22 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse36 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse36 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse36 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (.cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse35 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)) (= .cse35 |c_ULTIMATE.start_gcd_test_~b#1|)))))) (or (and .cse0 .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (<= (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (mod .cse2 256)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse3 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse3 |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse4 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse4 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse4 0)) (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|))) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse5 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse5 0))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse6 (mod .cse7 256))) (and (not (= .cse6 0)) (<= (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse6) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse8 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse8 |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse9 (mod .cse11 256))) (and (not (= .cse9 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse10 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse10 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))))) (<= (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse9) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse12 (mod .cse14 256))) (and (not (= .cse12 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod .cse13 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse13 0)))) (<= (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse12) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse15 .cse0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (< 127 (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse17 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse18) 256))) (and (<= .cse17 127) (= .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse18 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse19 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse20 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse21) 256))) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse20 (- 256))) (not (<= .cse20 127)) (not (= .cse21 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse22 .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse24 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse25) 256))) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse24 (- 256))) (not (<= .cse24 127)) (not (= .cse25 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0))))) (< 127 (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (<= (mod (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod .cse27 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse27 0)))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (mod .cse26 256)) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse28 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse28 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse28 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse29 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse30) 256))) (and (<= .cse29 127) (= .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse30 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse22 .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (<= (mod (+ .cse31 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse32 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse32 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (mod .cse31 256)) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse34 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse34 0)))) (< 127 (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) is different from false [2022-07-12 08:43:11,056 WARN L233 SmtUtils]: Spent 36.25s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:43:14,843 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (< 127 (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (<= (mod (+ .cse1 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (mod .cse1 256)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse2 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse3 0)) (= (mod (+ (* 255 |c_ULTIMATE.start_gcd_test_#res#1|) .cse3) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (<= (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse2 0))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse4 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (< 127 (mod (+ .cse4 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse6 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256) (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse8 0)) (= (mod (+ (* 255 |c_ULTIMATE.start_gcd_test_#res#1|) .cse8) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (< 127 (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (<= (mod (+ .cse9 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (mod .cse9 256)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse10 (mod .cse11 256))) (and (not (= .cse10 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse10) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse12 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse13 (mod .cse14 256))) (and (not (= .cse13 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse13) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-07-12 08:44:01,727 WARN L233 SmtUtils]: Spent 35.64s on a formula simplification. DAG size of input: 81 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 08:44:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 08:44:09,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 08:44:26,668 WARN L833 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~y~0#1| 0) (let ((.cse18 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (mod .cse18 256)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (<= .cse20 127)) (.cse15 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse21 (mod (+ .cse18 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse5 (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (mod (+ (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse9 (not (<= .cse21 127))) (.cse1 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (mod (+ (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) |c_ULTIMATE.start_gcd_test_~b#1|) 256)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse3 (not .cse15)) (.cse4 (<= .cse20 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse2 (not .cse7)) (.cse0 (not .cse6)) (.cse10 (<= .cse19 127))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (and (or .cse5 .cse6 .cse7 .cse8 .cse3) (or (and (or .cse5 .cse6 .cse8 .cse3) (or .cse0 .cse1 .cse3 .cse4)) .cse2)) .cse9)) .cse10) (or (let ((.cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256)) 256) 0))))) (.cse17 (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse12 (or .cse15 .cse16 .cse17)) (.cse13 (= .cse18 0)) (.cse11 (or .cse15 .cse0 .cse16 .cse17)) (.cse14 (or .cse15 .cse16 .cse6 .cse17))) (and (or (and (or (and .cse11 (or .cse6 (and .cse12 (or .cse5 .cse13 .cse8 .cse3)))) .cse7) (or .cse2 (and (or .cse6 (and .cse12 (or .cse5 .cse8 .cse3))) (or .cse0 (and .cse12 (or .cse1 .cse3 .cse4)))))) .cse9) (or (and (or .cse0 (and .cse12 (or .cse13 .cse1 .cse3 .cse4))) .cse14) .cse2) (or .cse7 (and .cse11 .cse14))))) (not .cse10))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false