./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/gcd_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/bitvector/gcd_3.c -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 17434adceb46f4d2d18d3a85d6d4ed55515fdf3dbd1a573601edbae0be0a7746 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:02:05,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:02:05,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:02:05,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:02:05,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:02:05,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:02:05,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:02:05,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:02:05,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:02:05,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:02:05,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:02:05,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:02:05,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:02:05,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:02:05,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:02:05,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:02:05,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:02:05,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:02:05,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:02:05,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:02:05,987 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:02:05,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:02:05,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:02:05,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:02:05,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:02:05,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:02:05,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:02:05,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:02:05,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:02:05,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:02:06,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:02:06,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:02:06,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:02:06,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:02:06,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:02:06,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:02:06,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:02:06,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:02:06,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:02:06,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:02:06,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:02:06,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:02:06,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:02:06,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:02:06,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:02:06,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:02:06,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:02:06,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:02:06,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:02:06,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:02:06,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:02:06,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:02:06,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:02:06,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:02:06,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:02:06,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:02:06,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:02:06,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:02:06,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:02:06,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:02:06,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:02:06,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:02:06,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:02:06,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:02:06,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:02:06,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:02:06,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:02:06,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:02:06,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:02:06,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:02:06,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:02:06,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:02:06,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:02:06,040 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:02:06,041 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:02:06,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:02:06,041 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 -> 17434adceb46f4d2d18d3a85d6d4ed55515fdf3dbd1a573601edbae0be0a7746 [2022-07-22 11:02:06,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:02:06,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:02:06,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:02:06,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:02:06,294 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:02:06,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_3.c [2022-07-22 11:02:06,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ef7be6f/43f72ad176bd438dbf806f10ffb8a3a6/FLAG09a8f0d88 [2022-07-22 11:02:06,713 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:02:06,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_3.c [2022-07-22 11:02:06,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ef7be6f/43f72ad176bd438dbf806f10ffb8a3a6/FLAG09a8f0d88 [2022-07-22 11:02:07,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ef7be6f/43f72ad176bd438dbf806f10ffb8a3a6 [2022-07-22 11:02:07,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:02:07,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:02:07,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:02:07,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:02:07,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:02:07,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f41fa5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07, skipping insertion in model container [2022-07-22 11:02:07,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:02:07,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:02:07,300 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/bitvector/gcd_3.c[664,677] [2022-07-22 11:02:07,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:02:07,320 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:02:07,335 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/bitvector/gcd_3.c[664,677] [2022-07-22 11:02:07,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:02:07,367 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:02:07,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07 WrapperNode [2022-07-22 11:02:07,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:02:07,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:02:07,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:02:07,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:02:07,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,404 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2022-07-22 11:02:07,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:02:07,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:02:07,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:02:07,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:02:07,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:02:07,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:02:07,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:02:07,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:02:07,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (1/1) ... [2022-07-22 11:02:07,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:02:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:02:07,459 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-22 11:02:07,461 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-22 11:02:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:02:07,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:02:07,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:02:07,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:02:07,539 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:02:07,540 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:02:07,624 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:02:07,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:02:07,629 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:02:07,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:02:07 BoogieIcfgContainer [2022-07-22 11:02:07,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:02:07,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:02:07,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:02:07,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:02:07,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:02:07" (1/3) ... [2022-07-22 11:02:07,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bb24a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:02:07, skipping insertion in model container [2022-07-22 11:02:07,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:07" (2/3) ... [2022-07-22 11:02:07,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bb24a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:02:07, skipping insertion in model container [2022-07-22 11:02:07,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:02:07" (3/3) ... [2022-07-22 11:02:07,641 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3.c [2022-07-22 11:02:07,655 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:02:07,655 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:02:07,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:02:07,725 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@6ac35a5b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ed028a8 [2022-07-22 11:02:07,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:02:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 11:02:07,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:07,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:07,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 777289588, now seen corresponding path program 1 times [2022-07-22 11:02:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:07,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010540031] [2022-07-22 11:02:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:07,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:02:08,000 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-22 11:02:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:02:08,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010540031] [2022-07-22 11:02:08,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010540031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:02:08,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:02:08,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:02:08,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890715230] [2022-07-22 11:02:08,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:02:08,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:02:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:02:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:02:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:02:08,060 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-22 11:02:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:02:08,125 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-07-22 11:02:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:02:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-22 11:02:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:02:08,141 INFO L225 Difference]: With dead ends: 48 [2022-07-22 11:02:08,142 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 11:02:08,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:02:08,151 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:02:08,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:02:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 11:02:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2022-07-22 11:02:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-22 11:02:08,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2022-07-22 11:02:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:02:08,179 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-22 11:02:08,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-22 11:02:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-07-22 11:02:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 11:02:08,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:08,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:08,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:02:08,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash -32057038, now seen corresponding path program 1 times [2022-07-22 11:02:08,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:08,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456719260] [2022-07-22 11:02:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:02:08,237 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-22 11:02:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:02:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456719260] [2022-07-22 11:02:08,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456719260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:02:08,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:02:08,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:02:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394229938] [2022-07-22 11:02:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:02:08,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:02:08,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:02:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:02:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:02:08,242 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-22 11:02:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:02:08,293 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-07-22 11:02:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:02:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-07-22 11:02:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:02:08,294 INFO L225 Difference]: With dead ends: 18 [2022-07-22 11:02:08,295 INFO L226 Difference]: Without dead ends: 12 [2022-07-22 11:02:08,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:02:08,296 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:02:08,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:02:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-22 11:02:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-22 11:02:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-22 11:02:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-07-22 11:02:08,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2022-07-22 11:02:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:02:08,301 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-22 11:02:08,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-22 11:02:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-07-22 11:02:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 11:02:08,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:08,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:08,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:02:08,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash 607524954, now seen corresponding path program 1 times [2022-07-22 11:02:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:08,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156057529] [2022-07-22 11:02:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:08,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 11:02:08,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180884450] [2022-07-22 11:02:08,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:08,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:02:08,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:02:08,319 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-22 11:02:08,376 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-22 11:02:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:02:08,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 11:02:08,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:02:19,860 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-22 11:02:19,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:02:37,276 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-22 11:02:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:02:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156057529] [2022-07-22 11:02:37,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 11:02:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180884450] [2022-07-22 11:02:37,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180884450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:02:37,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:02:37,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-22 11:02:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879978720] [2022-07-22 11:02:37,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:02:37,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 11:02:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:02:37,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 11:02:37,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=157, Unknown=10, NotChecked=0, Total=210 [2022-07-22 11:02:37,279 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:02:42,313 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-07-22 11:02:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:02:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 11:02:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:02:42,315 INFO L225 Difference]: With dead ends: 19 [2022-07-22 11:02:42,315 INFO L226 Difference]: Without dead ends: 13 [2022-07-22 11:02:42,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=70, Invalid=226, Unknown=10, NotChecked=0, Total=306 [2022-07-22 11:02:42,317 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:02:42,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 16 Unchecked, 0.2s Time] [2022-07-22 11:02:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-22 11:02:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-22 11:02:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-07-22 11:02:42,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-07-22 11:02:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:02:42,320 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-22 11:02:42,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-07-22 11:02:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 11:02:42,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:42,321 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:42,347 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-22 11:02:42,521 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-22 11:02:42,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:42,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1040269774, now seen corresponding path program 2 times [2022-07-22 11:02:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:42,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527577804] [2022-07-22 11:02:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:42,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 11:02:42,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625798531] [2022-07-22 11:02:42,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:02:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:02:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:02:42,542 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-22 11:02:42,549 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-22 11:02:42,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 11:02:42,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:02:42,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 11:02:42,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:02:49,633 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:02:50,580 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-22 11:02:50,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:02:56,563 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main_~x~0#1|)) (let ((.cse2 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse18 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse5 (not .cse2))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (or (< 127 .cse0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256)) (<= .cse0 |c_ULTIMATE.start_main_~x~0#1|))))) .cse2) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (mod .cse4 256))) (or (< 127 .cse3) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256)) (<= .cse3 |c_ULTIMATE.start_main_~x~0#1|))))) .cse2) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse6) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 127) (not (<= .cse7 127)) (<= .cse7 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse6 256) 127)))))) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse9 256))) (or (< 127 .cse8) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (<= .cse8 |c_ULTIMATE.start_main_~x~0#1|)))))) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse10 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse11 127))))))) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse13 256))) (or (< 127 .cse12) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256)) (<= .cse12 |c_ULTIMATE.start_main_~x~0#1|)))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse14) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 127) (= .cse14 0) (not (<= .cse15 127)) (<= .cse15 |c_ULTIMATE.start_main_~x~0#1|) (not (<= (mod .cse14 256) 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse17) (<= .cse17 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse16 256) 127))))) .cse18) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse19) 256))) (or (< 127 (mod .cse19 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse20) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256)) (<= .cse20 |c_ULTIMATE.start_main_~x~0#1|))))) .cse5) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse21 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse21) 256) 127)) (<= .cse22 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse22 127))))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse23) 256))) (or (< 127 (mod .cse23 256)) (= .cse23 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse24) (<= .cse24 |c_ULTIMATE.start_main_~x~0#1|)))))) (or .cse18 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse25) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse26) 256)) (<= .cse25 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse26 256) 127)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse27 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 127) (<= .cse28 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse28 127)))))) .cse2) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse29 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= .cse30 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse30 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (<= .cse32 127)) (<= .cse32 |c_ULTIMATE.start_main_~x~0#1|) (not (<= (mod .cse31 256) 127)))))) .cse5) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse33 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse33) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (<= .cse34 127)) (<= .cse34 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse33 256) 127)))))))))) is different from false [2022-07-22 11:02:58,576 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main_~x~0#1|)) (let ((.cse2 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse18 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse5 (not .cse2))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (or (< 127 .cse0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256)) (<= .cse0 |c_ULTIMATE.start_main_~x~0#1|))))) .cse2) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (mod .cse4 256))) (or (< 127 .cse3) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256)) (<= .cse3 |c_ULTIMATE.start_main_~x~0#1|))))) .cse2) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse6) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 127) (not (<= .cse7 127)) (<= .cse7 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse6 256) 127)))))) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse9 256))) (or (< 127 .cse8) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (<= .cse8 |c_ULTIMATE.start_main_~x~0#1|)))))) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse10 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse11 127))))))) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse13 256))) (or (< 127 .cse12) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256)) (<= .cse12 |c_ULTIMATE.start_main_~x~0#1|)))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse14) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 127) (= .cse14 0) (not (<= .cse15 127)) (<= .cse15 |c_ULTIMATE.start_main_~x~0#1|) (not (<= (mod .cse14 256) 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse17) (<= .cse17 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse16 256) 127))))) .cse18) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse19) 256))) (or (< 127 (mod .cse19 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse20) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256)) (<= .cse20 |c_ULTIMATE.start_main_~x~0#1|))))) .cse5) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse21 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse21) 256) 127)) (<= .cse22 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse22 127))))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse23) 256))) (or (< 127 (mod .cse23 256)) (= .cse23 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse24) (<= .cse24 |c_ULTIMATE.start_main_~x~0#1|)))))) (or .cse18 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse25) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse26) 256)) (<= .cse25 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse26 256) 127)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse27 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 127) (<= .cse28 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse28 127)))))) .cse2) (or .cse2 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse29 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= .cse30 |c_ULTIMATE.start_main_~x~0#1|) (not (<= .cse30 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (<= .cse32 127)) (<= .cse32 |c_ULTIMATE.start_main_~x~0#1|) (not (<= (mod .cse31 256) 127)))))) .cse5) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse33 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse33) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (<= .cse34 127)) (<= .cse34 |c_ULTIMATE.start_main_~x~0#1|) (<= (mod .cse33 256) 127)))))))))) is different from true [2022-07-22 11:03:34,282 WARN L233 SmtUtils]: Spent 30.32s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:03:34,339 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-22 11:03:34,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:34,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527577804] [2022-07-22 11:03:34,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 11:03:34,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625798531] [2022-07-22 11:03:34,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625798531] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:03:34,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:03:34,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-22 11:03:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72601466] [2022-07-22 11:03:34,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:03:34,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 11:03:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 11:03:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=146, Unknown=3, NotChecked=24, Total=210 [2022-07-22 11:03:34,343 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:34,694 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-07-22 11:03:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 11:03:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 11:03:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:34,695 INFO L225 Difference]: With dead ends: 20 [2022-07-22 11:03:34,695 INFO L226 Difference]: Without dead ends: 14 [2022-07-22 11:03:34,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=37, Invalid=146, Unknown=3, NotChecked=24, Total=210 [2022-07-22 11:03:34,696 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:34,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 61 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-07-22 11:03:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-22 11:03:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-22 11:03:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-22 11:03:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-22 11:03:34,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-07-22 11:03:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:34,700 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-22 11:03:34,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-22 11:03:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 11:03:34,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:34,700 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:34,718 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-22 11:03:34,901 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-22 11:03:34,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -582298790, now seen corresponding path program 3 times [2022-07-22 11:03:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:34,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502948692] [2022-07-22 11:03:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:34,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 11:03:34,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501878996] [2022-07-22 11:03:34,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 11:03:34,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:34,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:34,918 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-22 11:03:34,921 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-22 11:03:34,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 11:03:34,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:03:34,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 11:03:34,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:48,508 WARN L233 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:04:17,649 WARN L833 $PredicateComparison]: unable to prove that (and (not (< |c_ULTIMATE.start_main_~x~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse2 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main_~x~0#1| .cse2))) (let ((.cse1 (mod .cse3 256))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse1))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (not (<= (mod (+ .cse0 .cse1) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse0 (* 255 .cse1)) 256))) (not (= .cse2 0)) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (<= .cse2 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse4 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse7 (mod |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse6 (mod .cse7 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse6))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse4) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (<= (mod (+ .cse5 .cse6) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 256)) (not (<= (mod (+ .cse4 .cse7) 256) 127)) (<= .cse4 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse9 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse10 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse9 (- 256))))) (let ((.cse11 (mod .cse10 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse11))) (and (= .cse8 0) (not (<= .cse9 127)) (< 127 (mod (+ .cse10 (* .cse9 255)) 256)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse9) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse8 256)) (not (= .cse11 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse13 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse14 (mod |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse12 (mod .cse14 256))) (and (not (= .cse12 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse13) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse12) 256)) (not (= .cse13 0)) (<= (mod (+ .cse13 .cse14) 256) 127) (<= .cse13 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse17 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse18 (- 256))))) (let ((.cse16 (mod .cse17 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse16))) (and (not (= .cse15 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (mod (+ .cse15 (* 255 .cse16)) 256) (- 256))) (<= (mod (+ .cse17 (* .cse18 255)) 256) 127) (not (<= .cse18 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse18) (not (= .cse16 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse19 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse22 (mod |c_ULTIMATE.start_main_~x~0#1| .cse19))) (let ((.cse21 (mod .cse22 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse21))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse19) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (<= (mod (+ .cse20 .cse21) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse20 256)) (not (= .cse19 0)) (not (<= (mod (+ .cse19 .cse22) 256) 127)) (<= .cse19 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse25 (- 256))))) (let ((.cse24 (mod .cse26 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse24))) (and (not (= .cse23 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (mod (+ .cse23 (* 255 .cse24)) 256) (- 256))) (not (<= .cse25 127)) (< 127 (mod (+ .cse26 (* .cse25 255)) 256)) (<= (mod (+ .cse23 .cse24) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse25) (not (= .cse24 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse27 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse30 (mod |c_ULTIMATE.start_main_~x~0#1| .cse27))) (let ((.cse29 (mod .cse30 256))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse29))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse27) (<= (mod (+ .cse28 .cse29) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256)) (= .cse28 0) (not (<= (mod (+ .cse27 .cse30) 256) 127)) (<= .cse27 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse33 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse33 (- 256))))) (let ((.cse34 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse34))) (and (= .cse31 0) (<= (mod (+ .cse32 (* .cse33 255)) 256) 127) (not (<= .cse33 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse33) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse31 256)) (not (= .cse34 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse37 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse38 (mod |c_ULTIMATE.start_main_~x~0#1| .cse37))) (let ((.cse39 (mod .cse38 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse39))) (let ((.cse36 (mod (+ .cse35 (* 255 .cse39)) 256))) (and (not (= .cse35 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse36)) (not (= .cse37 0)) (<= (mod .cse35 256) 127) (<= (mod (+ .cse37 .cse38) 256) 127) (<= .cse37 127) (not (<= .cse36 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse42 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse43 (mod |c_ULTIMATE.start_main_~x~0#1| .cse42))) (let ((.cse41 (mod .cse43 256))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse41))) (and (not (= .cse40 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (<= (mod (+ .cse40 .cse41) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse40 (* 255 .cse41)) 256))) (not (= .cse42 0)) (not (<= (mod (+ .cse42 .cse43) 256) 127)) (<= .cse42 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse46 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse45 (mod (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse46 (- 256))) 256))) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse45))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (mod (+ .cse44 (* 255 .cse45)) 256) (- 256))) (not (<= .cse46 127)) (not (<= (mod (+ .cse44 .cse45) 256) 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse46) (not (= .cse45 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse48 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse50 (mod |c_ULTIMATE.start_main_~x~0#1| .cse48))) (let ((.cse47 (mod .cse50 256))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse47))) (and (not (= .cse47 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse48) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse49 256)) (= .cse49 0) (not (= .cse48 0)) (<= (mod (+ .cse48 .cse50) 256) 127) (<= .cse48 127))))))))) is different from false [2022-07-22 11:04:24,005 WARN L833 $PredicateComparison]: unable to prove that (and (not (< |c_ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)) (<= .cse14 127) (= .cse14 |c_ULTIMATE.start_gcd_test_~b#1|))))) (.cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse13 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse13 (- 256))))))) (.cse6 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse12 0) (= (mod .cse12 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) (.cse7 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (and (or .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse1 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse2) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse1) (not (= .cse2 0)) (<= .cse1 127) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse4 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse3) 256))) (and (not (= .cse3 0)) (not (<= .cse4 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse4)))))) .cse5 .cse6) (not .cse7)) (and (or .cse0 .cse5 .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse8) 256))) (and (not (= .cse8 0)) (not (<= .cse9 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse9 (- 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse11) 256))) (and (<= .cse10 127) (not (= .cse11 0)) (= .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)))))) .cse7))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse17 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse16 (mod (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse17 (- 256))) 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse16))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse15 (* 255 .cse16)) 256) (- 256))) (not (<= .cse17 127)) (not (<= (mod (+ .cse15 .cse16) 256) 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse17) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse21 (mod |c_ULTIMATE.start_main_~x~0#1| .cse18))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse20))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse18) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (<= (mod (+ .cse19 .cse20) 256) 127)) (not (<= (mod (+ .cse18 .cse21) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse19 256)) (<= .cse18 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse24 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse25 (- 256))))) (let ((.cse23 (mod .cse24 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse23))) (and (not (= .cse22 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse22 (* 255 .cse23)) 256) (- 256))) (<= (mod (+ .cse24 (* .cse25 255)) 256) 127) (not (<= .cse25 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse25) (not (= .cse23 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse29 (mod |c_ULTIMATE.start_main_~x~0#1| .cse28))) (let ((.cse27 (mod .cse29 256))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse27))) (and (not (= .cse26 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (<= (mod (+ .cse26 .cse27) 256) 127) (not (= .cse28 0)) (not (<= (mod (+ .cse28 .cse29) 256) 127)) (<= .cse28 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (+ .cse26 (* 255 .cse27)) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse32 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse33 (mod |c_ULTIMATE.start_main_~x~0#1| .cse32))) (let ((.cse31 (mod .cse33 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse31))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (not (<= (mod (+ .cse30 .cse31) 256) 127)) (not (= .cse32 0)) (not (<= (mod (+ .cse32 .cse33) 256) 127)) (<= .cse32 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (+ .cse30 (* 255 .cse31)) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse35 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main_~x~0#1| .cse35))) (let ((.cse38 (mod .cse36 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse38))) (let ((.cse37 (mod (+ .cse34 (* 255 .cse38)) 256))) (and (not (= .cse34 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (not (= .cse35 0)) (<= (mod .cse34 256) 127) (<= (mod (+ .cse35 .cse36) 256) 127) (<= .cse35 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (- 256) .cse37)) (not (<= .cse37 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse40 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse41 (mod |c_ULTIMATE.start_main_~x~0#1| .cse40))) (let ((.cse39 (mod .cse41 256))) (and (not (= .cse39 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse40) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse39) 256)) (<= (mod (+ .cse40 .cse41) 256) 127) (<= .cse40 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse42 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse45 (mod |c_ULTIMATE.start_main_~x~0#1| .cse42))) (let ((.cse44 (mod .cse45 256))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse44))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse42) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (<= (mod (+ .cse43 .cse44) 256) 127) (not (<= (mod (+ .cse42 .cse45) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse43 256)) (<= .cse42 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse48 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse49 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse48 (- 256))))) (let ((.cse47 (mod .cse49 256))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse47))) (and (not (= .cse46 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse46 (* 255 .cse47)) 256) (- 256))) (not (<= .cse48 127)) (< 127 (mod (+ .cse49 (* .cse48 255)) 256)) (<= (mod (+ .cse46 .cse47) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse48) (not (= .cse47 0)))))))))) is different from false [2022-07-22 11:04:31,489 WARN L833 $PredicateComparison]: unable to prove that (and (not (< |c_ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (.cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_17|)))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (and (not .cse0) (or .cse1 .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse3 0)) (= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse3) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)))))) (and (or .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse4) 256) 0) (not (= .cse4 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)))) .cse2) .cse0))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse7 (- 256))) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse6))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse5 (* 255 .cse6)) 256) (- 256))) (not (<= .cse7 127)) (not (<= (mod (+ .cse5 .cse6) 256) 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse7) (not (= .cse6 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse8 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse11 (mod |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse10 (mod .cse11 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse8) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (<= (mod (+ .cse9 .cse10) 256) 127)) (not (<= (mod (+ .cse8 .cse11) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse9 256)) (<= .cse8 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse14 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse15 (- 256))))) (let ((.cse13 (mod .cse14 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse13))) (and (not (= .cse12 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse12 (* 255 .cse13)) 256) (- 256))) (<= (mod (+ .cse14 (* .cse15 255)) 256) 127) (not (<= .cse15 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse15) (not (= .cse13 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse19 (mod |c_ULTIMATE.start_main_~x~0#1| .cse18))) (let ((.cse17 (mod .cse19 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse17))) (and (not (= .cse16 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (<= (mod (+ .cse16 .cse17) 256) 127) (not (= .cse18 0)) (not (<= (mod (+ .cse18 .cse19) 256) 127)) (<= .cse18 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (+ .cse16 (* 255 .cse17)) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse22 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse23 (mod |c_ULTIMATE.start_main_~x~0#1| .cse22))) (let ((.cse21 (mod .cse23 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse21))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (not (<= (mod (+ .cse20 .cse21) 256) 127)) (not (= .cse22 0)) (not (<= (mod (+ .cse22 .cse23) 256) 127)) (<= .cse22 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (+ .cse20 (* 255 .cse21)) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main_~x~0#1| .cse25))) (let ((.cse28 (mod .cse26 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse28))) (let ((.cse27 (mod (+ .cse24 (* 255 .cse28)) 256))) (and (not (= .cse24 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (not (= .cse25 0)) (<= (mod .cse24 256) 127) (<= (mod (+ .cse25 .cse26) 256) 127) (<= .cse25 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (- 256) .cse27)) (not (<= .cse27 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse31 (mod |c_ULTIMATE.start_main_~x~0#1| .cse30))) (let ((.cse29 (mod .cse31 256))) (and (not (= .cse29 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse30) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse29) 256)) (<= (mod (+ .cse30 .cse31) 256) 127) (<= .cse30 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse32 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main_~x~0#1| .cse32))) (let ((.cse34 (mod .cse35 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse34))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse32) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (<= (mod (+ .cse33 .cse34) 256) 127) (not (<= (mod (+ .cse32 .cse35) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse33 256)) (<= .cse32 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse38 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse39 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse38 (- 256))))) (let ((.cse37 (mod .cse39 256))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse37))) (and (not (= .cse36 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse36 (* 255 .cse37)) 256) (- 256))) (not (<= .cse38 127)) (< 127 (mod (+ .cse39 (* .cse38 255)) 256)) (<= (mod (+ .cse36 .cse37) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse38) (not (= .cse37 0)))))))))) is different from false [2022-07-22 11:06:25,776 WARN L233 SmtUtils]: Spent 1.70m on a formula simplification. DAG size of input: 120 DAG size of output: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:06:31,352 WARN L833 $PredicateComparison]: unable to prove that (and (not (< |c_ULTIMATE.start_main_~x~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse4 (mod |c_ULTIMATE.start_main_~x~0#1| .cse0))) (let ((.cse2 (mod .cse4 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse2))) (let ((.cse3 (mod .cse1 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (<= (mod (+ .cse1 .cse2) 256) 127)) (not (= .cse3 0)) (not (<= (mod (+ .cse0 .cse4) 256) 127)) (<= |c_ULTIMATE.start_main_~g~0#1| .cse3) (<= .cse0 127)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main_~x~0#1| .cse7))) (let ((.cse6 (mod .cse8 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse6))) (and (not (= .cse5 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (<= (mod (+ .cse5 .cse6) 256) 127) (<= (+ 256 |c_ULTIMATE.start_main_~g~0#1|) (mod (+ .cse5 (* 255 .cse6)) 256)) (not (= .cse7 0)) (not (<= (mod (+ .cse7 .cse8) 256) 127)) (<= .cse7 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse12 (mod |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse10 (mod .cse12 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse10))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (not (<= (mod (+ .cse9 .cse10) 256) 127)) (<= (+ 256 |c_ULTIMATE.start_main_~g~0#1|) (mod (+ .cse9 (* 255 .cse10)) 256)) (not (= .cse11 0)) (not (<= (mod (+ .cse11 .cse12) 256) 127)) (<= .cse11 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse13 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse17 (mod |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse15 (mod .cse17 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse15))) (let ((.cse16 (mod .cse14 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse13) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (<= (mod (+ .cse14 .cse15) 256) 127) (not (= .cse16 0)) (not (<= (mod (+ .cse13 .cse17) 256) 127)) (<= |c_ULTIMATE.start_main_~g~0#1| .cse16) (<= .cse13 127)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse20 (mod (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse18 (- 256))) 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse20))) (and (not (<= .cse18 127)) (<= (+ 256 |c_ULTIMATE.start_main_~g~0#1|) (mod (+ .cse19 (* 255 .cse20)) 256)) (not (<= (mod (+ .cse19 .cse20) 256) 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse18) (not (= .cse20 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse23 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse24 (mod |c_ULTIMATE.start_main_~x~0#1| .cse23))) (let ((.cse25 (mod .cse24 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse25))) (let ((.cse22 (mod (+ .cse21 (* 255 .cse25)) 256))) (and (not (= .cse21 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (<= (+ 256 |c_ULTIMATE.start_main_~g~0#1|) .cse22) (not (= .cse23 0)) (<= (mod .cse21 256) 127) (<= (mod (+ .cse23 .cse24) 256) 127) (<= .cse23 127) (not (<= .cse22 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse27 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse29 (mod |c_ULTIMATE.start_main_~x~0#1| .cse27))) (let ((.cse26 (mod .cse29 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse26) 256))) (and (not (= .cse26 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse27) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (= .cse28 0)) (<= (mod (+ .cse27 .cse29) 256) 127) (<= |c_ULTIMATE.start_main_~g~0#1| .cse28) (<= .cse27 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse33 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse31 (- 256))))) (let ((.cse32 (mod .cse33 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse32))) (and (not (= .cse30 0)) (not (<= .cse31 127)) (<= (+ 256 |c_ULTIMATE.start_main_~g~0#1|) (mod (+ .cse30 (* 255 .cse32)) 256)) (< 127 (mod (+ .cse33 (* .cse31 255)) 256)) (<= (mod (+ .cse30 .cse32) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse31) (not (= .cse32 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse36 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse36 (- 256))))) (let ((.cse37 (mod .cse35 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse37))) (and (not (= .cse34 0)) (<= (mod (+ .cse35 (* .cse36 255)) 256) 127) (not (<= .cse36 127)) (<= (+ 256 |c_ULTIMATE.start_main_~g~0#1|) (mod (+ .cse34 (* 255 .cse37)) 256)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse36) (not (= .cse37 0)))))))))) is different from false [2022-07-22 11:06:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-22 11:06:38,932 INFO L328 TraceCheckSpWp]: Computing backward predicates...