./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/gcd_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/gcd_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17434adceb46f4d2d18d3a85d6d4ed55515fdf3dbd1a573601edbae0be0a7746 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:48:37,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:48:37,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:48:38,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:48:38,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:48:38,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:48:38,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:48:38,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:48:38,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:48:38,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:48:38,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:48:38,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:48:38,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:48:38,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:48:38,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:48:38,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:48:38,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:48:38,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:48:38,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:48:38,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:48:38,042 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:48:38,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:48:38,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:48:38,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:48:38,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:48:38,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:48:38,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:48:38,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:48:38,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:48:38,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:48:38,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:48:38,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:48:38,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:48:38,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:48:38,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:48:38,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:48:38,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:48:38,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:48:38,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:48:38,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:48:38,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:48:38,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:48:38,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:48:38,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:48:38,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:48:38,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:48:38,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:48:38,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:48:38,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:48:38,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:48:38,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:48:38,073 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:48:38,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:48:38,073 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:48:38,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:48:38,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:48:38,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:48:38,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:48:38,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:48:38,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:48:38,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:48:38,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:48:38,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:48:38,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:48:38,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:48:38,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:48:38,076 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:48:38,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:48:38,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:48:38,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17434adceb46f4d2d18d3a85d6d4ed55515fdf3dbd1a573601edbae0be0a7746 [2022-07-19 10:48:38,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:48:38,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:48:38,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:48:38,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:48:38,320 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:48:38,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_3.c [2022-07-19 10:48:38,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1daae4c3/50a383db9456406eb4667d41d15addde/FLAG67d610abb [2022-07-19 10:48:38,755 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:48:38,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_3.c [2022-07-19 10:48:38,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1daae4c3/50a383db9456406eb4667d41d15addde/FLAG67d610abb [2022-07-19 10:48:38,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1daae4c3/50a383db9456406eb4667d41d15addde [2022-07-19 10:48:38,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:48:38,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:48:38,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:48:38,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:48:38,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:48:38,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a261b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38, skipping insertion in model container [2022-07-19 10:48:38,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:48:38,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:48:38,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_3.c[664,677] [2022-07-19 10:48:38,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:48:38,918 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:48:38,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_3.c[664,677] [2022-07-19 10:48:38,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:48:38,936 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:48:38,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38 WrapperNode [2022-07-19 10:48:38,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:48:38,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:48:38,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:48:38,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:48:38,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,956 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2022-07-19 10:48:38,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:48:38,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:48:38,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:48:38,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:48:38,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:48:38,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:48:38,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:48:38,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:48:38,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (1/1) ... [2022-07-19 10:48:38,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:48:39,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:39,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:48:39,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:48:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:48:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:48:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:48:39,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:48:39,089 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:48:39,090 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:48:39,221 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:48:39,225 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:48:39,239 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:48:39,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:39 BoogieIcfgContainer [2022-07-19 10:48:39,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:48:39,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:48:39,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:48:39,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:48:39,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:48:38" (1/3) ... [2022-07-19 10:48:39,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed4d5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:48:39, skipping insertion in model container [2022-07-19 10:48:39,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:38" (2/3) ... [2022-07-19 10:48:39,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed4d5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:48:39, skipping insertion in model container [2022-07-19 10:48:39,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:39" (3/3) ... [2022-07-19 10:48:39,247 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3.c [2022-07-19 10:48:39,263 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:48:39,263 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:48:39,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:48:39,330 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ffa39c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d063679 [2022-07-19 10:48:39,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:48:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 10:48:39,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:39,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:39,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash 777289588, now seen corresponding path program 1 times [2022-07-19 10:48:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:39,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620942294] [2022-07-19 10:48:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:39,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:39,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620942294] [2022-07-19 10:48:39,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620942294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:48:39,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:48:39,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:48:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041441409] [2022-07-19 10:48:39,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:48:39,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:48:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:48:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:48:39,567 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:39,610 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-07-19 10:48:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:48:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-19 10:48:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:39,617 INFO L225 Difference]: With dead ends: 48 [2022-07-19 10:48:39,617 INFO L226 Difference]: Without dead ends: 18 [2022-07-19 10:48:39,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:48:39,622 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:39,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-19 10:48:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2022-07-19 10:48:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-19 10:48:39,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2022-07-19 10:48:39,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:39,643 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-19 10:48:39,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-07-19 10:48:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 10:48:39,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:39,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:39,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:48:39,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -32057038, now seen corresponding path program 1 times [2022-07-19 10:48:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:39,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366991782] [2022-07-19 10:48:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:39,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366991782] [2022-07-19 10:48:39,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366991782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:48:39,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:48:39,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:48:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219713174] [2022-07-19 10:48:39,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:48:39,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:48:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:48:39,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:48:39,728 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:39,782 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-07-19 10:48:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:48:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-19 10:48:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:39,784 INFO L225 Difference]: With dead ends: 18 [2022-07-19 10:48:39,784 INFO L226 Difference]: Without dead ends: 12 [2022-07-19 10:48:39,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:48:39,788 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:39,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-19 10:48:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-19 10:48:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-07-19 10:48:39,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2022-07-19 10:48:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:39,794 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-19 10:48:39,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-07-19 10:48:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:48:39,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:39,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:39,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:48:39,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:39,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:39,803 INFO L85 PathProgramCache]: Analyzing trace with hash 607524954, now seen corresponding path program 1 times [2022-07-19 10:48:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:39,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147145021] [2022-07-19 10:48:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:39,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:48:39,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913246499] [2022-07-19 10:48:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:39,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:39,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:39,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:48:39,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:48:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:39,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 10:48:39,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:51,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:49:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:49:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:49:08,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147145021] [2022-07-19 10:49:08,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:49:08,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913246499] [2022-07-19 10:49:08,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913246499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:49:08,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:49:08,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-19 10:49:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026885640] [2022-07-19 10:49:08,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:49:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:49:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:49:08,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:49:08,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=157, Unknown=10, NotChecked=0, Total=210 [2022-07-19 10:49:08,026 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:49:13,353 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-07-19 10:49:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:49:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 10:49:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:49:13,354 INFO L225 Difference]: With dead ends: 19 [2022-07-19 10:49:13,354 INFO L226 Difference]: Without dead ends: 13 [2022-07-19 10:49:13,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=70, Invalid=226, Unknown=10, NotChecked=0, Total=306 [2022-07-19 10:49:13,356 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:49:13,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 16 Unchecked, 0.4s Time] [2022-07-19 10:49:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-19 10:49:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-19 10:49:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-07-19 10:49:13,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-07-19 10:49:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:49:13,358 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-19 10:49:13,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-07-19 10:49:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:49:13,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:49:13,358 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:49:13,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:49:13,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:49:13,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:49:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:49:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1040269774, now seen corresponding path program 2 times [2022-07-19 10:49:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:49:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080191064] [2022-07-19 10:49:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:49:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:49:13,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:49:13,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011811300] [2022-07-19 10:49:13,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:49:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:49:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:49:13,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:49:13,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:49:13,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:49:13,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:49:13,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 10:49:13,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:49:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:49:21,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:49:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:49:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:49:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080191064] [2022-07-19 10:49:48,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:49:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011811300] [2022-07-19 10:49:48,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011811300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:49:48,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:49:48,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-19 10:49:48,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76891569] [2022-07-19 10:49:48,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:49:48,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:49:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:49:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:49:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=161, Unknown=7, NotChecked=0, Total=210 [2022-07-19 10:49:48,114 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:49:55,555 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-19 10:49:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:49:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 10:49:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:49:55,556 INFO L225 Difference]: With dead ends: 26 [2022-07-19 10:49:55,556 INFO L226 Difference]: Without dead ends: 16 [2022-07-19 10:49:55,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=70, Invalid=262, Unknown=10, NotChecked=0, Total=342 [2022-07-19 10:49:55,557 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:49:55,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-07-19 10:49:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-19 10:49:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-19 10:49:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-07-19 10:49:55,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-07-19 10:49:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:49:55,559 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-07-19 10:49:55,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-07-19 10:49:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 10:49:55,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:49:55,559 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:49:55,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:49:55,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:49:55,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:49:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:49:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -582298790, now seen corresponding path program 3 times [2022-07-19 10:49:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:49:55,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001979025] [2022-07-19 10:49:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:49:55,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:49:55,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:49:55,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031959899] [2022-07-19 10:49:55,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:49:55,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:49:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:49:55,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:49:55,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:49:55,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:49:55,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:49:55,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-19 10:49:55,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:12,148 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:53:08,670 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse2 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse1 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse2 (- 256))))) (let ((.cse3 (mod .cse1 256))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse3))) (and (= .cse0 0) (< 127 (mod (+ .cse1 (* .cse2 255)) 256)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse2) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse0 256)) (< 127 .cse2) (not (= .cse3 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse6 (- 256))) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse5))) (and (= (mod (+ .cse4 (* 255 .cse5)) 256) (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse6) (< 127 .cse6) (< 127 (mod (+ .cse4 .cse5) 256)) (not (= .cse5 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse9 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse8 (mod (mod |c_ULTIMATE.start_main_~x~0#1| .cse9) 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse8))) (and (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ .cse7 (* 255 .cse8)) 256)) (< 127 (mod (+ .cse7 .cse8) 256)) (not (= .cse9 0)) (<= (mod .cse7 256) 127) (<= .cse9 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse12 (mod (mod |c_ULTIMATE.start_main_~x~0#1| .cse10) 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse12))) (let ((.cse13 (mod .cse11 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse10) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (<= (mod (+ .cse11 .cse12) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse13) (not (= .cse10 0)) (<= .cse13 127) (<= .cse10 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse15 (mod |c_ULTIMATE.start_main_~x~0#1| .cse14))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| (mod .cse15 256)))) (and (< 127 (mod (+ .cse14 .cse15) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse14) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse16 256)) (= .cse16 0) (not (= .cse14 0)) (<= .cse14 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse19 (mod |c_ULTIMATE.start_main_~x~0#1| .cse18))) (let ((.cse17 (mod .cse19 256))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse18) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse17) 256)) (not (= .cse18 0)) (<= (mod (+ .cse18 .cse19) 256) 127) (<= .cse18 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse21 (mod |c_ULTIMATE.start_main_~x~0#1| .cse20))) (let ((.cse23 (mod .cse21 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse23))) (and (< 127 (mod (+ .cse20 .cse21) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse20) (<= (mod (+ .cse22 .cse23) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse22 256)) (<= .cse20 127)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse25 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse26 (- 256))))) (let ((.cse27 (mod .cse25 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse27))) (and (= .cse24 0) (<= (mod (+ .cse25 (* .cse26 255)) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse26) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 256)) (< 127 .cse26) (not (= .cse27 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse31 (mod |c_ULTIMATE.start_main_~x~0#1| .cse30))) (let ((.cse32 (mod .cse31 256))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse32))) (let ((.cse29 (mod (+ .cse28 (* 255 .cse32)) 256))) (and (not (= .cse28 0)) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) .cse29) (< 127 .cse29) (not (= .cse30 0)) (<= (mod .cse28 256) 127) (<= (mod (+ .cse30 .cse31) 256) 127) (<= .cse30 127)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse36 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse36 (- 256))))) (let ((.cse34 (mod .cse35 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse34))) (and (not (= .cse33 0)) (= (mod (+ .cse33 (* 255 .cse34)) 256) (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (< 127 (mod (+ .cse35 (* .cse36 255)) 256)) (<= (mod (+ .cse33 .cse34) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse36) (< 127 .cse36) (not (= .cse34 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse40 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse39 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse40 (- 256))))) (let ((.cse38 (mod .cse39 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse38))) (and (not (= .cse37 0)) (= (mod (+ .cse37 (* 255 .cse38)) 256) (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (<= (mod (+ .cse39 (* .cse40 255)) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse40) (< 127 .cse40) (not (= .cse38 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse42 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse43 (mod |c_ULTIMATE.start_main_~x~0#1| .cse42))) (let ((.cse44 (mod .cse43 256))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse44))) (and (not (= .cse41 0)) (< 127 (mod (+ .cse42 .cse43) 256)) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) (mod (+ .cse41 (* 255 .cse44)) 256)) (<= (mod (+ .cse41 .cse44) 256) 127) (not (= .cse42 0)) (<= .cse42 127)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse46 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse48 (mod |c_ULTIMATE.start_main_~x~0#1| .cse46))) (let ((.cse45 (mod .cse48 256))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse45))) (and (not (= .cse45 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse46) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse47 256)) (= .cse47 0) (not (= .cse46 0)) (<= (mod (+ .cse46 .cse48) 256) 127) (<= .cse46 127)))))))) (not (< |c_ULTIMATE.start_main_~x~0#1| 0))) is different from false [2022-07-19 10:53:17,598 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse2 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse2 (- 256))) 256))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse1))) (and (= (mod (+ .cse0 (* 255 .cse1)) 256) (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse2) (< 127 .cse2) (< 127 (mod (+ .cse0 .cse1) 256)) (not (= .cse1 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse5 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse4 (mod (mod |c_ULTIMATE.start_main_~x~0#1| .cse5) 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse4))) (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ .cse3 (* 255 .cse4)) 256)) (< 127 (mod (+ .cse3 .cse4) 256)) (not (= .cse5 0)) (<= (mod .cse3 256) 127) (<= .cse5 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse7 (mod |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse9 (mod .cse7 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse9))) (and (< 127 (mod (+ .cse6 .cse7) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse6) (<= (mod (+ .cse8 .cse9) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse8 256)) (<= .cse6 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse12 (mod |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse10 (mod .cse12 256))) (and (not (= .cse10 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse11) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse10) 256)) (<= (mod (+ .cse11 .cse12) 256) 127) (<= .cse11 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse13 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse15 (mod (mod |c_ULTIMATE.start_main_~x~0#1| .cse13) 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse15))) (let ((.cse16 (mod .cse14 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_16| .cse13) (not (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0)) (not (<= (mod (+ .cse14 .cse15) 256) 127)) (<= .cse16 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse16) (<= .cse13 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_16| 0) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse19 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse19 (- 256))))) (let ((.cse20 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse20))) (and (not (= .cse17 0)) (<= (mod (+ .cse18 (* .cse19 255)) 256) 127) (= (mod (+ .cse17 (* 255 .cse20)) 256) (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse19) (< 127 .cse19) (not (= .cse20 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse23 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse22 (mod |c_ULTIMATE.start_main_~x~0#1| (+ .cse23 (- 256))))) (let ((.cse24 (mod .cse22 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse24))) (and (not (= .cse21 0)) (< 127 (mod (+ .cse22 (* .cse23 255)) 256)) (= (mod (+ .cse21 (* 255 .cse24)) 256) (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (<= (mod (+ .cse21 .cse24) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse23) (< 127 .cse23) (not (= .cse24 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse27 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main_~x~0#1| .cse27))) (let ((.cse29 (mod .cse28 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse29))) (let ((.cse26 (mod (+ .cse25 (* 255 .cse29)) 256))) (and (not (= .cse25 0)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse26) (< 127 .cse26) (not (= .cse27 0)) (<= (mod .cse25 256) 127) (<= (mod (+ .cse27 .cse28) 256) 127) (<= .cse27 127)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_18| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_18|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main_~x~0#1| .cse31))) (let ((.cse33 (mod .cse32 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse33))) (and (not (= .cse30 0)) (< 127 (mod (+ .cse31 .cse32) 256)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ .cse30 (* 255 .cse33)) 256)) (<= (mod (+ .cse30 .cse33) 256) 127) (not (= .cse31 0)) (<= .cse31 127))))))))))) (not (< |c_ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse35 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (let ((.cse43 (mod .cse44 256))) (let ((.cse42 (<= .cse43 127))) (or (and (not .cse42) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse43 (- 256)))) (and .cse42 (= .cse43 |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (not (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)) (= .cse44 0)))))) (.cse34 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (and .cse34 (or .cse35 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse36 0)) (let ((.cse38 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse36) 256))) (let ((.cse37 (<= .cse38 127))) (or (and .cse37 (= .cse38 |c_ULTIMATE.start_gcd_test_~b#1|)) (and (not .cse37) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse38 (- 256))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)))))) (and (or .cse35 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_17| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse39 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0) (let ((.cse41 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse39) 256))) (let ((.cse40 (<= .cse41 127))) (or (and (not .cse40) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse41))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse41) .cse40)))))))) (not .cse34)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false