./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_2_4.i --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/combinations/gcd_3+newton_2_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d3494a64b97ff198f649db9990f4b24e7ade2324c824b5bf3f291e4c895b3e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 20:03:20,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 20:03:20,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 20:03:20,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 20:03:20,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 20:03:20,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 20:03:20,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 20:03:20,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 20:03:20,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 20:03:20,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 20:03:20,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 20:03:20,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 20:03:20,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 20:03:20,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 20:03:20,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 20:03:20,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 20:03:20,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 20:03:20,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 20:03:20,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 20:03:20,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 20:03:20,554 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 20:03:20,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 20:03:20,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 20:03:20,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 20:03:20,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 20:03:20,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 20:03:20,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 20:03:20,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 20:03:20,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 20:03:20,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 20:03:20,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 20:03:20,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 20:03:20,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 20:03:20,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 20:03:20,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 20:03:20,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 20:03:20,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 20:03:20,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 20:03:20,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 20:03:20,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 20:03:20,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 20:03:20,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 20:03:20,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 20:03:20,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 20:03:20,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 20:03:20,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 20:03:20,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 20:03:20,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 20:03:20,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 20:03:20,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 20:03:20,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 20:03:20,602 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 20:03:20,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 20:03:20,603 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 20:03:20,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 20:03:20,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 20:03:20,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 20:03:20,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 20:03:20,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 20:03:20,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 20:03:20,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 20:03:20,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 20:03:20,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 20:03:20,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 20:03:20,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 20:03:20,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 20:03:20,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 20:03:20,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:03:20,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 20:03:20,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 20:03:20,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 20:03:20,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 20:03:20,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 20:03:20,608 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 20:03:20,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 20:03:20,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 20:03:20,608 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 -> 1d3494a64b97ff198f649db9990f4b24e7ade2324c824b5bf3f291e4c895b3e7 [2022-07-22 20:03:20,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 20:03:20,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 20:03:20,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 20:03:20,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 20:03:20,847 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 20:03:20,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_2_4.i [2022-07-22 20:03:20,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714d3940b/80e24318e04d4b33aff215bd62e64294/FLAG89170bcd3 [2022-07-22 20:03:21,291 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 20:03:21,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i [2022-07-22 20:03:21,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714d3940b/80e24318e04d4b33aff215bd62e64294/FLAG89170bcd3 [2022-07-22 20:03:21,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714d3940b/80e24318e04d4b33aff215bd62e64294 [2022-07-22 20:03:21,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 20:03:21,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 20:03:21,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 20:03:21,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 20:03:21,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 20:03:21,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59056002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21, skipping insertion in model container [2022-07-22 20:03:21,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 20:03:21,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 20:03:21,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[1226,1239] [2022-07-22 20:03:21,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[2841,2854] [2022-07-22 20:03:21,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:03:21,598 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 20:03:21,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[1226,1239] [2022-07-22 20:03:21,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[2841,2854] [2022-07-22 20:03:21,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:03:21,646 INFO L208 MainTranslator]: Completed translation [2022-07-22 20:03:21,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21 WrapperNode [2022-07-22 20:03:21,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 20:03:21,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 20:03:21,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 20:03:21,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 20:03:21,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,694 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-07-22 20:03:21,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 20:03:21,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 20:03:21,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 20:03:21,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 20:03:21,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 20:03:21,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 20:03:21,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 20:03:21,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 20:03:21,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (1/1) ... [2022-07-22 20:03:21,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:03:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:03:21,759 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 20:03:21,761 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 20:03:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 20:03:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-07-22 20:03:21,784 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-07-22 20:03:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-07-22 20:03:21,784 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-07-22 20:03:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 20:03:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 20:03:21,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 20:03:21,840 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 20:03:21,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 20:03:21,979 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 20:03:21,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 20:03:21,984 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 20:03:21,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:03:21 BoogieIcfgContainer [2022-07-22 20:03:21,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 20:03:21,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 20:03:21,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 20:03:22,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 20:03:22,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:03:21" (1/3) ... [2022-07-22 20:03:22,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7939165b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:03:22, skipping insertion in model container [2022-07-22 20:03:22,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:03:21" (2/3) ... [2022-07-22 20:03:22,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7939165b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:03:22, skipping insertion in model container [2022-07-22 20:03:22,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:03:21" (3/3) ... [2022-07-22 20:03:22,008 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_4.i [2022-07-22 20:03:22,021 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 20:03:22,035 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 20:03:22,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 20:03:22,099 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@2e9bf65, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42a97a28 [2022-07-22 20:03:22,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 20:03:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 20:03:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 20:03:22,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:03:22,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:03:22,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:03:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:03:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-07-22 20:03:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:03:22,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536471133] [2022-07-22 20:03:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:03:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:03:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:03:22,380 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 20:03:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:03:22,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536471133] [2022-07-22 20:03:22,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536471133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:03:22,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:03:22,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 20:03:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316293266] [2022-07-22 20:03:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:03:22,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 20:03:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:03:22,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 20:03:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 20:03:22,421 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:03:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:03:22,493 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-07-22 20:03:22,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:03:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 20:03:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:03:22,502 INFO L225 Difference]: With dead ends: 90 [2022-07-22 20:03:22,502 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 20:03:22,505 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 20:03:22,513 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 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 20:03:22,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:03:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 20:03:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-07-22 20:03:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 20:03:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-22 20:03:22,555 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-07-22 20:03:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:03:22,556 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-22 20:03:22,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:03:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-22 20:03:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 20:03:22,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:03:22,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:03:22,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 20:03:22,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:03:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:03:22,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-07-22 20:03:22,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:03:22,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931395077] [2022-07-22 20:03:22,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:03:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:03:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:03:22,658 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 20:03:22,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:03:22,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931395077] [2022-07-22 20:03:22,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931395077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:03:22,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:03:22,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:03:22,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417008192] [2022-07-22 20:03:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:03:22,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:03:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:03:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:03:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:03:22,667 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:03:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:03:22,750 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-07-22 20:03:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:03:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 20:03:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:03:22,752 INFO L225 Difference]: With dead ends: 36 [2022-07-22 20:03:22,753 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 20:03:22,753 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 20:03:22,755 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 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 20:03:22,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:03:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 20:03:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 20:03:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 20:03:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-22 20:03:22,766 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-07-22 20:03:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:03:22,769 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-22 20:03:22,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:03:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-22 20:03:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 20:03:22,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:03:22,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:03:22,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 20:03:22,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:03:22,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:03:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-07-22 20:03:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:03:22,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578291081] [2022-07-22 20:03:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:03:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:03:22,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 20:03:22,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152990507] [2022-07-22 20:03:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:03:22,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:03:22,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:03:22,801 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 20:03:22,802 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 20:03:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:03:22,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 20:03:22,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:03:42,466 WARN L233 SmtUtils]: Spent 14.72s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:04:04,007 WARN L233 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 44 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:04:18,111 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:04:43,058 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:04:43,550 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 20:04:43,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:04:53,183 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 20:04:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:04:53,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578291081] [2022-07-22 20:04:53,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 20:04:53,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152990507] [2022-07-22 20:04:53,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152990507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:04:53,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 20:04:53,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-22 20:04:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124536574] [2022-07-22 20:04:53,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 20:04:53,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 20:04:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:04:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 20:04:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=198, Unknown=20, NotChecked=0, Total=272 [2022-07-22 20:04:53,186 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 20:04:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:04:55,737 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-22 20:04:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:04:55,737 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 20:04:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:04:55,738 INFO L225 Difference]: With dead ends: 42 [2022-07-22 20:04:55,738 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 20:04:55,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 89.8s TimeCoverageRelationStatistics Valid=74, Invalid=247, Unknown=21, NotChecked=0, Total=342 [2022-07-22 20:04:55,740 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:04:55,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 231 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-07-22 20:04:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 20:04:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-07-22 20:04:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 20:04:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-07-22 20:04:55,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-07-22 20:04:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:04:55,745 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-07-22 20:04:55,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 20:04:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-07-22 20:04:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 20:04:55,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:04:55,746 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:04:55,771 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 20:04:55,959 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 20:04:55,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:04:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:04:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1561924787, now seen corresponding path program 2 times [2022-07-22 20:04:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:04:55,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401798504] [2022-07-22 20:04:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:04:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:04:55,970 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 20:04:55,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951415815] [2022-07-22 20:04:55,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 20:04:55,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:04:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:04:55,972 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 20:04:55,993 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 20:04:56,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 20:04:56,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 20:04:56,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 20:04:56,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:05:00,837 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse3 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse2 (not .cse3))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod .cse0 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (= 0 .cse0) (<= .cse1 127) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0))))) .cse2) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse4) 256) 127) (not (<= .cse5 127)) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse4) 256)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (not (= 0 .cse4)))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse7 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod .cse6 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= 0 .cse6) (not (<= .cse7 127)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse7))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse8 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse8 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse8))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse9) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse10) (<= .cse10 127) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse9) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (not (= 0 .cse9))))) .cse2) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= .cse11 127)) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse12) 256)) (not (<= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse12) 256) 127)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse11) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (not (= 0 .cse12)))))) (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse13 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse13) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= .cse13 127) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))))) (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse14) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256) 127)) (<= .cse14 127) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse15) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))))))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-07-22 20:05:20,445 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 20:05:20,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:05:40,788 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse5 (not .cse12))) (and (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse1) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse2) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (<= .cse1 |c_ULTIMATE.start_main1_~x~0#1|) (<= (mod .cse2 256) 127)))))) (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 (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (or (<= .cse3 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127) (not (<= .cse3 127)) (<= (mod .cse4 256) 127))))) .cse5) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (<= .cse6 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127) (= .cse7 0) (not (<= .cse6 127)) (not (<= (mod .cse7 256) 127))))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse8) 256))) (or (< 127 (mod .cse8 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse9) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse8) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (<= .cse9 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or (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 (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (not (<= .cse11 127)) (<= (mod .cse10 256) 127))))) .cse5) (or .cse12 (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 ((.cse13 (mod .cse14 256))) (or (< 127 .cse13) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse14) 256)) (<= .cse13 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse15 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (<= .cse16 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse16 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse17) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= .cse18 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (not (<= .cse18 127)) (not (<= (mod .cse17 256) 127)))))) .cse5) (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 (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse20) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (<= .cse20 |c_ULTIMATE.start_main1_~x~0#1|) (<= (mod .cse19 256) 127))))) .cse0) (or .cse12 (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 (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0)) (<= .cse22 |c_ULTIMATE.start_main1_~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) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 0)) (<= .cse24 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or (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 .cse26 256))) (or (< 127 .cse25) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 0)) (<= .cse25 |c_ULTIMATE.start_main1_~x~0#1|))))) .cse12) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse28 256))) (or (< 127 .cse27) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (<= .cse27 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or .cse12 (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 (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse29) 256) 127)) (<= .cse30 |c_ULTIMATE.start_main1_~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 .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 (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127)) (<= .cse32 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse32 127)))))) .cse12) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse34 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse34 256))) (or (< 127 .cse33) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse34) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse34) 256)) (<= .cse33 |c_ULTIMATE.start_main1_~x~0#1|)))))))))) is different from false [2022-07-22 20:05:42,800 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse5 (not .cse12))) (and (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse1) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse2) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (<= .cse1 |c_ULTIMATE.start_main1_~x~0#1|) (<= (mod .cse2 256) 127)))))) (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 (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (or (<= .cse3 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127) (not (<= .cse3 127)) (<= (mod .cse4 256) 127))))) .cse5) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (<= .cse6 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127) (= .cse7 0) (not (<= .cse6 127)) (not (<= (mod .cse7 256) 127))))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse8) 256))) (or (< 127 (mod .cse8 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse9) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse8) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (<= .cse9 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or (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 (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (not (<= .cse11 127)) (<= (mod .cse10 256) 127))))) .cse5) (or .cse12 (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 ((.cse13 (mod .cse14 256))) (or (< 127 .cse13) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse14) 256)) (<= .cse13 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse15 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (<= .cse16 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse16 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse17) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= .cse18 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (not (<= .cse18 127)) (not (<= (mod .cse17 256) 127)))))) .cse5) (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 (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse20) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (<= .cse20 |c_ULTIMATE.start_main1_~x~0#1|) (<= (mod .cse19 256) 127))))) .cse0) (or .cse12 (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 (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0)) (<= .cse22 |c_ULTIMATE.start_main1_~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) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 0)) (<= .cse24 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or (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 .cse26 256))) (or (< 127 .cse25) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 0)) (<= .cse25 |c_ULTIMATE.start_main1_~x~0#1|))))) .cse12) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse28 256))) (or (< 127 .cse27) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (<= .cse27 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or .cse12 (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 (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse29) 256) 127)) (<= .cse30 |c_ULTIMATE.start_main1_~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 .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 (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127)) (<= .cse32 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse32 127)))))) .cse12) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse34 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse34 256))) (or (< 127 .cse33) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse34) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse34) 256)) (<= .cse33 |c_ULTIMATE.start_main1_~x~0#1|)))))))))) is different from true [2022-07-22 20:05:52,752 WARN L855 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod .cse0 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse0) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256) 127)) (<= .cse1 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse1 127)))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod .cse3 256))) (or (< 127 .cse2) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse3) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse2) 256) 0)) (<= .cse2 |c_ULTIMATE.start_main1_~x~0#1|))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod .cse5 256))) (or (< 127 .cse4) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)) (<= .cse4 |c_ULTIMATE.start_main1_~x~0#1|))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse7 256))) (or (< 127 .cse6) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256)) (<= .cse6 |c_ULTIMATE.start_main1_~x~0#1|))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse8 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (<= .cse9 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse9 127)))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse11 256))) (or (< 127 .cse10) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse11) 256)) (<= .cse10 |c_ULTIMATE.start_main1_~x~0#1|))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod .cse12 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse12) 256) 127)) (<= .cse13 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse13 127)))))) (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 .cse14 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (<= .cse15 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse15 127)))))))) is different from true [2022-07-22 20:05:53,009 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 20:05:53,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:05:53,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401798504] [2022-07-22 20:05:53,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 20:05:53,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951415815] [2022-07-22 20:05:53,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951415815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:05:53,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 20:05:53,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-22 20:05:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763915068] [2022-07-22 20:05:53,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 20:05:53,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 20:05:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:05:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 20:05:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=142, Unknown=6, NotChecked=78, Total=272 [2022-07-22 20:05:53,012 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:05:57,068 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse5 (not .cse12))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse1) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse2) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (<= .cse1 |c_ULTIMATE.start_main1_~x~0#1|) (<= (mod .cse2 256) 127)))))) (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 (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (or (<= .cse3 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127) (not (<= .cse3 127)) (<= (mod .cse4 256) 127))))) .cse5) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (<= .cse6 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127) (= .cse7 0) (not (<= .cse6 127)) (not (<= (mod .cse7 256) 127))))))) (or .cse5 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse8) 256))) (or (< 127 (mod .cse8 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse9) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse8) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (<= .cse9 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or (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 (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (not (<= .cse11 127)) (<= (mod .cse10 256) 127))))) .cse5) (or .cse12 (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 ((.cse13 (mod .cse14 256))) (or (< 127 .cse13) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse14) 256)) (<= .cse13 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse15 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (<= .cse16 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse16 127))))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse17) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= .cse18 |c_ULTIMATE.start_main1_~x~0#1|) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (not (<= .cse18 127)) (not (<= (mod .cse17 256) 127)))))) .cse5) (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 (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse20) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (<= .cse20 |c_ULTIMATE.start_main1_~x~0#1|) (<= (mod .cse19 256) 127))))) .cse0) (or .cse12 (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 (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0)) (<= .cse22 |c_ULTIMATE.start_main1_~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) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 0)) (<= .cse24 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or (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 .cse26 256))) (or (< 127 .cse25) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 0)) (<= .cse25 |c_ULTIMATE.start_main1_~x~0#1|))))) .cse12) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse28 256))) (or (< 127 .cse27) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (<= .cse27 |c_ULTIMATE.start_main1_~x~0#1|)))))) (or .cse12 (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 (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse29) 256) 127)) (<= .cse30 |c_ULTIMATE.start_main1_~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 .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 (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127)) (<= .cse32 |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse32 127)))))) .cse12) (or .cse12 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse34 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse34 256))) (or (< 127 .cse33) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse34) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse34) 256)) (<= .cse33 |c_ULTIMATE.start_main1_~x~0#1|))))))))) .cse5))) is different from true [2022-07-22 20:06:42,995 WARN L233 SmtUtils]: Spent 30.11s on a formula simplification. DAG size of input: 76 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:06:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:06:43,011 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-22 20:06:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:06:43,012 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 20:06:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:06:43,012 INFO L225 Difference]: With dead ends: 44 [2022-07-22 20:06:43,012 INFO L226 Difference]: Without dead ends: 35 [2022-07-22 20:06:43,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=13, NotChecked=116, Total=342 [2022-07-22 20:06:43,014 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:06:43,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-07-22 20:06:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-22 20:06:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-07-22 20:06:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 20:06:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-22 20:06:43,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2022-07-22 20:06:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:06:43,019 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-22 20:06:43,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:06:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-22 20:06:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 20:06:43,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:06:43,024 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:06:43,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 20:06:43,225 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 20:06:43,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:06:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:06:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2052984139, now seen corresponding path program 1 times [2022-07-22 20:06:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:06:43,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371590419] [2022-07-22 20:06:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:06:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:06:43,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 20:06:43,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245798573] [2022-07-22 20:06:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:06:43,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:06:43,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:06:43,246 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 20:06:43,250 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 20:06:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:06:43,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 20:06:43,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:06:52,785 WARN L233 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:07:39,783 WARN L233 SmtUtils]: Spent 27.54s on a formula simplification. DAG size of input: 70 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:07:59,445 WARN L233 SmtUtils]: Spent 10.99s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)