./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_2_1.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 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:31:36,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:31:36,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:31:36,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:31:36,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:31:36,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:31:36,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:31:36,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:31:36,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:31:36,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:31:36,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:31:36,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:31:36,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:31:36,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:31:36,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:31:36,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:31:36,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:31:36,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:31:36,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:31:36,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:31:36,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:31:36,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:31:36,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:31:36,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:31:36,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:31:36,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:31:36,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:31:36,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:31:36,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:31:36,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:31:36,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:31:36,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:31:36,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:31:36,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:31:36,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:31:36,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:31:36,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:31:36,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:31:36,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:31:36,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:31:36,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:31:36,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:31:36,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:31:36,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:31:36,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:31:36,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:31:36,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:31:36,813 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:31:36,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:31:36,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:31:36,813 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:31:36,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:31:36,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:31:36,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:31:36,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:31:36,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:31:36,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:31:36,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:31:36,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:31:36,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:31:36,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:31:36,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:31:36,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:31:36,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:31:36,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:31:36,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:31:36,817 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:31:36,817 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:31:36,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:31:36,817 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 -> 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 [2022-02-20 19:31:36,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:31:37,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:31:37,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:31:37,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:31:37,020 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:31:37,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-02-20 19:31:37,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3786f0080/c9494ee8257048c0a644059b0c0e01b1/FLAG0bc8b2d0c [2022-02-20 19:31:37,417 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:31:37,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-02-20 19:31:37,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3786f0080/c9494ee8257048c0a644059b0c0e01b1/FLAG0bc8b2d0c [2022-02-20 19:31:37,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3786f0080/c9494ee8257048c0a644059b0c0e01b1 [2022-02-20 19:31:37,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:31:37,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:31:37,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:31:37,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:31:37,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:31:37,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29938cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37, skipping insertion in model container [2022-02-20 19:31:37,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:31:37,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:31:37,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-02-20 19:31:37,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_2+newton_2_1.i[2841,2854] [2022-02-20 19:31:37,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:31:37,594 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:31:37,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-02-20 19:31:37,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-02-20 19:31:37,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:31:37,623 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:31:37,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37 WrapperNode [2022-02-20 19:31:37,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:31:37,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:31:37,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:31:37,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:31:37,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,671 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-02-20 19:31:37,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:31:37,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:31:37,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:31:37,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:31:37,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:31:37,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:31:37,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:31:37,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:31:37,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (1/1) ... [2022-02-20 19:31:37,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:31:37,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:31:37,736 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-02-20 19:31:37,755 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-02-20 19:31:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:31:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:31:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:31:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:31:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:31:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:31:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:31:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:31:37,809 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:31:37,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:31:38,028 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:31:38,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:31:38,034 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:31:38,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:31:38 BoogieIcfgContainer [2022-02-20 19:31:38,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:31:38,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:31:38,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:31:38,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:31:38,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:31:37" (1/3) ... [2022-02-20 19:31:38,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ab0214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:31:38, skipping insertion in model container [2022-02-20 19:31:38,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:31:37" (2/3) ... [2022-02-20 19:31:38,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ab0214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:31:38, skipping insertion in model container [2022-02-20 19:31:38,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:31:38" (3/3) ... [2022-02-20 19:31:38,040 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_1.i [2022-02-20 19:31:38,043 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:31:38,043 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:31:38,070 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:31:38,074 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:31:38,074 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:31:38,086 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-02-20 19:31:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:31:38,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:31:38,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:31:38,089 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:31:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:31:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-02-20 19:31:38,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:31:38,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178032547] [2022-02-20 19:31:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:31:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:31:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:31:38,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-02-20 19:31:38,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {40#true} is VALID [2022-02-20 19:31:38,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {42#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:31:38,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {42#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:31:38,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} is VALID [2022-02-20 19:31:38,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} assume !(0 != gcd_test_~b#1); {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} is VALID [2022-02-20 19:31:38,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} gcd_test_#res#1 := gcd_test_~a#1; {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} is VALID [2022-02-20 19:31:38,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} is VALID [2022-02-20 19:31:38,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {41#false} is VALID [2022-02-20 19:31:38,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume 0 == __VERIFIER_assert_~cond#1; {41#false} is VALID [2022-02-20 19:31:38,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 19:31:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:31:38,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:31:38,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178032547] [2022-02-20 19:31:38,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178032547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:31:38,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:31:38,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:31:38,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592301113] [2022-02-20 19:31:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:31:38,246 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-02-20 19:31:38,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:31:38,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:31:38,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:31:38,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:31:38,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:31:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:31:38,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:31:38,280 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-02-20 19:31:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:38,397 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-02-20 19:31:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:31:38,398 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-02-20 19:31:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:31:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:31:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-02-20 19:31:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:31:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-02-20 19:31:38,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 111 transitions. [2022-02-20 19:31:38,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:31:38,486 INFO L225 Difference]: With dead ends: 90 [2022-02-20 19:31:38,486 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 19:31:38,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:31:38,490 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:31:38,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:31:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 19:31:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-20 19:31:38,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:31:38,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second 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-02-20 19:31:38,509 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second 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-02-20 19:31:38,510 INFO L87 Difference]: Start difference. First operand 36 states. Second 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-02-20 19:31:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:38,512 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:31:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 19:31:38,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:31:38,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:31:38,513 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 36 states. [2022-02-20 19:31:38,514 INFO L87 Difference]: Start difference. First 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) Second operand 36 states. [2022-02-20 19:31:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:38,516 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:31:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 19:31:38,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:31:38,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:31:38,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:31:38,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:31:38,517 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-02-20 19:31:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 19:31:38,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-02-20 19:31:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:31:38,520 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 19:31:38,520 INFO L471 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-02-20 19:31:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 19:31:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:31:38,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:31:38,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:31:38,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:31:38,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:31:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:31:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-02-20 19:31:38,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:31:38,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615946576] [2022-02-20 19:31:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:31:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:31:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:31:38,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {271#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {271#true} is VALID [2022-02-20 19:31:38,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {271#true} is VALID [2022-02-20 19:31:38,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {273#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:31:38,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {273#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {273#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:31:38,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {273#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !(gcd_test_~b#1 < 0); {273#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:31:38,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !(0 != gcd_test_~b#1); {274#(<= |ULTIMATE.start_main1_~y~0#1| 0)} is VALID [2022-02-20 19:31:38,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(<= |ULTIMATE.start_main1_~y~0#1| 0)} gcd_test_#res#1 := gcd_test_~a#1; {274#(<= |ULTIMATE.start_main1_~y~0#1| 0)} is VALID [2022-02-20 19:31:38,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#(<= |ULTIMATE.start_main1_~y~0#1| 0)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {274#(<= |ULTIMATE.start_main1_~y~0#1| 0)} is VALID [2022-02-20 19:31:38,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#(<= |ULTIMATE.start_main1_~y~0#1| 0)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {272#false} is VALID [2022-02-20 19:31:38,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#false} assume 0 == __VERIFIER_assert_~cond#1; {272#false} is VALID [2022-02-20 19:31:38,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-02-20 19:31:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:31:38,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:31:38,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615946576] [2022-02-20 19:31:38,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615946576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:31:38,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:31:38,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:31:38,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703941248] [2022-02-20 19:31:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:31:38,570 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-02-20 19:31:38,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:31:38,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:31:38,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:31:38,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:31:38,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:31:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:31:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:31:38,580 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:31:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:38,649 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:31:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:31:38,650 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-02-20 19:31:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:31:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:31:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-02-20 19:31:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:31:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-02-20 19:31:38,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-02-20 19:31:38,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:31:38,681 INFO L225 Difference]: With dead ends: 36 [2022-02-20 19:31:38,681 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 19:31:38,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:31:38,686 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:31:38,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:31:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 19:31:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 19:31:38,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:31:38,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second 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-02-20 19:31:38,695 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second 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-02-20 19:31:38,695 INFO L87 Difference]: Start difference. First operand 30 states. Second 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-02-20 19:31:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:38,702 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 19:31:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:31:38,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:31:38,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:31:38,703 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 30 states. [2022-02-20 19:31:38,704 INFO L87 Difference]: Start difference. First 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) Second operand 30 states. [2022-02-20 19:31:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:38,707 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 19:31:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:31:38,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:31:38,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:31:38,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:31:38,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:31:38,709 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-02-20 19:31:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 19:31:38,715 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-02-20 19:31:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:31:38,716 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 19:31:38,716 INFO L471 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-02-20 19:31:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:31:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 19:31:38,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:31:38,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:31:38,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:31:38,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:31:38,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:31:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-02-20 19:31:38,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:31:38,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905946806] [2022-02-20 19:31:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:31:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:31:38,747 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:31:38,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108585220] [2022-02-20 19:31:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:31:38,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:31:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:31:38,756 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-02-20 19:31:38,757 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-02-20 19:31:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:31:38,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:31:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:31:38,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:31:38,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-02-20 19:31:38,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {420#true} is VALID [2022-02-20 19:31:39,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {448#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {448#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~0#1|)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {452#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {456#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:31:39,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {421#false} is VALID [2022-02-20 19:31:39,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-02-20 19:31:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:31:39,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:31:39,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-02-20 19:31:39,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {421#false} is VALID [2022-02-20 19:31:39,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {456#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:31:39,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {448#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~0#1|)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {452#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {448#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {441#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {431#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:31:39,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {420#true} is VALID [2022-02-20 19:31:39,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-02-20 19:31:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:31:39,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:31:39,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905946806] [2022-02-20 19:31:39,167 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:31:39,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108585220] [2022-02-20 19:31:39,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108585220] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:31:39,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:31:39,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-02-20 19:31:39,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609641046] [2022-02-20 19:31:39,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:31:39,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 19:31:39,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:31:39,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:31:39,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:31:39,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:31:39,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:31:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:31:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:31:39,183 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:31:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:39,348 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-20 19:31:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:31:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 19:31:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:31:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:31:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 19:31:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:31:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 19:31:39,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-02-20 19:31:39,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:31:39,386 INFO L225 Difference]: With dead ends: 37 [2022-02-20 19:31:39,387 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 19:31:39,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:31:39,388 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:31:39,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:31:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 19:31:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 19:31:39,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:31:39,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second 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-02-20 19:31:39,394 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second 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-02-20 19:31:39,394 INFO L87 Difference]: Start difference. First operand 31 states. Second 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-02-20 19:31:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:39,396 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 19:31:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:31:39,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:31:39,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:31:39,397 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 31 states. [2022-02-20 19:31:39,401 INFO L87 Difference]: Start difference. First 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) Second operand 31 states. [2022-02-20 19:31:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:31:39,403 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 19:31:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:31:39,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:31:39,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:31:39,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:31:39,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:31:39,404 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-02-20 19:31:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-20 19:31:39,405 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-02-20 19:31:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:31:39,405 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-20 19:31:39,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:31:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:31:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:31:39,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:31:39,406 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:31:39,427 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-02-20 19:31:39,625 WARN L452 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-02-20 19:31:39,625 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:31:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:31:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-02-20 19:31:39,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:31:39,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925932520] [2022-02-20 19:31:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:31:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:31:39,642 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:31:39,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669936062] [2022-02-20 19:31:39,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:31:39,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:31:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:31:39,644 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-02-20 19:31:39,659 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-02-20 19:31:39,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:31:39,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:31:39,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 19:31:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:31:39,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:32:48,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {646#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {646#true} is VALID [2022-02-20 19:32:48,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {646#true} is VALID [2022-02-20 19:32:48,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {646#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {657#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is VALID [2022-02-20 19:32:48,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {657#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127))} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {657#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is VALID [2022-02-20 19:32:48,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {657#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127))} assume !(gcd_test_~b#1 < 0); {664#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~b#1| 0)) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is VALID [2022-02-20 19:32:48,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~b#1| 0)) (<= |ULTIMATE.start_main1_~y~0#1| 127))} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {668#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (or (and (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0))) (and (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= (+ |ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_gcd_test_~a#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is VALID [2022-02-20 19:32:50,322 WARN L290 TraceCheckUtils]: 6: Hoare triple {668#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (or (and (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0))) (and (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= (+ |ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_gcd_test_~a#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))) (<= |ULTIMATE.start_main1_~y~0#1| 127))} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {672#(and (<= |ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) (+ |ULTIMATE.start_gcd_test_~b#1| 256)) (not (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (+ |ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))))} is UNKNOWN [2022-02-20 19:32:50,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {672#(and (<= |ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (and (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) (+ |ULTIMATE.start_gcd_test_~b#1| 256)) (not (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (+ |ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))))} assume !(0 != gcd_test_~b#1); {676#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (+ |ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is VALID [2022-02-20 19:32:52,429 WARN L290 TraceCheckUtils]: 8: Hoare triple {676#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (+ |ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))) (<= |ULTIMATE.start_main1_~y~0#1| 127))} gcd_test_#res#1 := gcd_test_~a#1; {680#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256) |ULTIMATE.start_gcd_test_#res#1|) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= (+ 256 |ULTIMATE.start_gcd_test_#res#1|) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is UNKNOWN [2022-02-20 19:32:54,495 WARN L290 TraceCheckUtils]: 9: Hoare triple {680#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256) |ULTIMATE.start_gcd_test_#res#1|) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (= (+ 256 |ULTIMATE.start_gcd_test_#res#1|) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) (<= |ULTIMATE.start_main1_~y~0#1| 127))} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {684#(and (<= |ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (+ (- 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256))) 256) 0) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (<= (+ 256 |ULTIMATE.start_main1_~g~0#1|) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)) 256) 0) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (<= |ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))))} is UNKNOWN [2022-02-20 19:32:54,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {684#(and (<= |ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |v_ULTIMATE.start_gcd_test_~a#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_12| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (+ (- 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256))) 256) 0) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (<= (+ 256 |ULTIMATE.start_main1_~g~0#1|) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) (* 255 |v_ULTIMATE.start_gcd_test_~b#1_12|)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256)) 256) 0) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 0)) (<= |ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_12| 0)))))} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {688#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:32:54,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {688#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {647#false} is VALID [2022-02-20 19:32:54,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {647#false} assume !false; {647#false} is VALID [2022-02-20 19:32:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:32:54,538 INFO L328 TraceCheckSpWp]: Computing backward predicates...