./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_1+newton_3_8.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_1+newton_3_8.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 fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:30:46,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:30:46,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:30:46,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:30:46,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:30:46,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:30:46,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:30:46,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:30:46,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:30:46,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:30:46,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:30:46,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:30:46,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:30:46,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:30:46,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:30:46,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:30:46,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:30:46,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:30:46,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:30:46,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:30:46,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:30:46,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:30:46,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:30:46,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:30:46,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:30:46,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:30:46,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:30:46,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:30:46,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:30:46,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:30:46,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:30:46,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:30:46,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:30:46,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:30:46,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:30:46,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:30:46,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:30:46,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:30:46,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:30:46,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:30:46,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:30:46,552 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:30:46,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:30:46,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:30:46,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:30:46,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:30:46,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:30:46,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:30:46,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:30:46,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:30:46,589 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:30:46,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:30:46,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:30:46,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:30:46,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:30:46,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:30:46,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:30:46,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:30:46,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:30:46,592 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:30:46,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:30:46,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:30:46,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:30:46,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:30:46,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:30:46,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:30:46,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:30:46,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:30:46,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:30:46,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:30:46,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:30:46,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:30:46,594 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:30:46,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:30:46,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:30:46,595 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 -> fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 [2022-02-20 19:30:46,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:30:46,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:30:46,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:30:46,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:30:46,835 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:30:46,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2022-02-20 19:30:46,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99a03be7/4f34321cfe9d4eabb93cae8a5ac5870a/FLAGddaa69181 [2022-02-20 19:30:47,326 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:30:47,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2022-02-20 19:30:47,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99a03be7/4f34321cfe9d4eabb93cae8a5ac5870a/FLAGddaa69181 [2022-02-20 19:30:47,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99a03be7/4f34321cfe9d4eabb93cae8a5ac5870a [2022-02-20 19:30:47,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:30:47,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:30:47,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:30:47,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:30:47,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:30:47,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a3a5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47, skipping insertion in model container [2022-02-20 19:30:47,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:30:47,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:30:47,514 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_1+newton_3_8.i[1226,1239] [2022-02-20 19:30:47,536 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_1+newton_3_8.i[2828,2841] [2022-02-20 19:30:47,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:30:47,545 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:30:47,555 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_1+newton_3_8.i[1226,1239] [2022-02-20 19:30:47,565 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_1+newton_3_8.i[2828,2841] [2022-02-20 19:30:47,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:30:47,577 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:30:47,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47 WrapperNode [2022-02-20 19:30:47,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:30:47,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:30:47,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:30:47,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:30:47,584 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:30:47" (1/1) ... [2022-02-20 19:30:47,589 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:30:47" (1/1) ... [2022-02-20 19:30:47,611 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2022-02-20 19:30:47,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:30:47,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:30:47,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:30:47,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:30:47,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:30:47,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:30:47,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:30:47,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:30:47,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (1/1) ... [2022-02-20 19:30:47,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:30:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:30:47,680 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:30:47,694 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:30:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:30:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:30:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:30:47,715 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:30:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:30:47,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:30:47,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:30:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:30:47,777 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:30:47,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:30:48,079 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:30:48,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:30:48,088 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:30:48,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:30:48 BoogieIcfgContainer [2022-02-20 19:30:48,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:30:48,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:30:48,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:30:48,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:30:48,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:30:47" (1/3) ... [2022-02-20 19:30:48,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d53a1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:30:48, skipping insertion in model container [2022-02-20 19:30:48,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:30:47" (2/3) ... [2022-02-20 19:30:48,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d53a1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:30:48, skipping insertion in model container [2022-02-20 19:30:48,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:30:48" (3/3) ... [2022-02-20 19:30:48,099 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_8.i [2022-02-20 19:30:48,105 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:30:48,105 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:30:48,156 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:30:48,162 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:30:48,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:30:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:30:48,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:30:48,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:30:48,187 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:30:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:30:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-02-20 19:30:48,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:30:48,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824595284] [2022-02-20 19:30:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:30:48,292 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:30:48,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996583623] [2022-02-20 19:30:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:48,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:30:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:30:48,295 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:30:48,333 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:30:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:30:48,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 19:30:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:30:48,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:30:48,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#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); {43#true} is VALID [2022-02-20 19:30:48,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {43#true} is VALID [2022-02-20 19:30:48,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {43#true} is VALID [2022-02-20 19:30:48,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {43#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~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; {43#true} is VALID [2022-02-20 19:30:48,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {43#true} 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); {43#true} is VALID [2022-02-20 19:30:48,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} 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#true} is VALID [2022-02-20 19:30:48,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#true} assume !true; {44#false} is VALID [2022-02-20 19:30:48,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {44#false} gcd_test_#res#1 := gcd_test_~a#1; {44#false} is VALID [2022-02-20 19:30:48,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {44#false} 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;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {44#false} is VALID [2022-02-20 19:30:48,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond#1; {44#false} is VALID [2022-02-20 19:30:48,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 19:30:48,494 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:30:48,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:30:48,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:30:48,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824595284] [2022-02-20 19:30:48,495 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:30:48,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996583623] [2022-02-20 19:30:48,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996583623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:30:48,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:30:48,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:30:48,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394187060] [2022-02-20 19:30:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:30:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:30:48,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,518 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:30:48,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:30:48,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:30:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:30:48,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:30:48,538 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:48,590 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-02-20 19:30:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:30:48,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:30:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2022-02-20 19:30:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2022-02-20 19:30:48,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2022-02-20 19:30:48,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:30:48,709 INFO L225 Difference]: With dead ends: 72 [2022-02-20 19:30:48,709 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 19:30:48,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:30:48,714 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:30:48,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:30:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 19:30:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 19:30:48,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:30:48,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:48,740 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:48,740 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:48,744 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 19:30:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 19:30:48,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:30:48,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:30:48,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 19:30:48,746 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 19:30:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:48,749 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 19:30:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 19:30:48,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:30:48,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:30:48,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:30:48,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:30:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-20 19:30:48,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-02-20 19:30:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:30:48,755 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-20 19:30:48,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 19:30:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:30:48,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:30:48,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:30:48,782 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:30:48,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 19:30:48,980 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:30:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:30:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-02-20 19:30:48,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:30:48,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524883731] [2022-02-20 19:30:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:30:49,011 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:30:49,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383085798] [2022-02-20 19:30:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:30:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:30:49,014 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:30:49,045 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:30:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:30:49,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 19:30:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:30:49,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:30:49,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#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); {278#true} is VALID [2022-02-20 19:30:49,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {278#true} is VALID [2022-02-20 19:30:49,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {278#true} is VALID [2022-02-20 19:30:49,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {278#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~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; {292#(< 0 |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:30:49,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {292#(< 0 |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); {292#(< 0 |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:30:49,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(< 0 |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); {279#false} is VALID [2022-02-20 19:30:49,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {279#false} assume !(0 != gcd_test_~b#1); {279#false} is VALID [2022-02-20 19:30:49,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#false} gcd_test_#res#1 := gcd_test_~a#1; {279#false} is VALID [2022-02-20 19:30:49,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#false} 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;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {279#false} is VALID [2022-02-20 19:30:49,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {279#false} assume 0 == __VERIFIER_assert_~cond#1; {279#false} is VALID [2022-02-20 19:30:49,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#false} assume !false; {279#false} is VALID [2022-02-20 19:30:49,167 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:30:49,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:30:49,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:30:49,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524883731] [2022-02-20 19:30:49,168 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:30:49,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383085798] [2022-02-20 19:30:49,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383085798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:30:49,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:30:49,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:30:49,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782446579] [2022-02-20 19:30:49,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:30:49,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:30:49,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,180 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:30:49,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:30:49,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:30:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:30:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:30:49,182 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:49,267 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 19:30:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:30:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:30:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 19:30:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 19:30:49,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 19:30:49,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:30:49,309 INFO L225 Difference]: With dead ends: 39 [2022-02-20 19:30:49,309 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 19:30:49,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:30:49,310 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:30:49,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:30:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 19:30:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 19:30:49,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:30:49,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:49,315 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:49,315 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:49,317 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 19:30:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:30:49,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:30:49,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:30:49,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 19:30:49,319 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 19:30:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:49,321 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 19:30:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:30:49,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:30:49,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:30:49,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:30:49,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:30:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-02-20 19:30:49,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-02-20 19:30:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:30:49,324 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-02-20 19:30:49,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:30:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 19:30:49,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:30:49,326 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:30:49,351 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-02-20 19:30:49,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 19:30:49,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:30:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:30:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-02-20 19:30:49,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:30:49,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982464613] [2022-02-20 19:30:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:30:49,564 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:30:49,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166497520] [2022-02-20 19:30:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:49,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:30:49,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:30:49,571 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-02-20 19:30:49,574 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-02-20 19:30:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:30:49,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 19:30:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:30:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:30:49,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#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); {470#true} is VALID [2022-02-20 19:30:49,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {470#true} is VALID [2022-02-20 19:30:49,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {470#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {470#true} is VALID [2022-02-20 19:30:49,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {470#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~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; {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(= |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); {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(= |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; {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {501#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#1|)} is VALID [2022-02-20 19:30:49,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#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;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {505#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:30:49,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {471#false} is VALID [2022-02-20 19:30:49,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-02-20 19:30:49,707 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:30:49,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:30:49,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-02-20 19:30:49,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {471#false} is VALID [2022-02-20 19:30:49,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#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;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {505#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:30:49,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {501#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#1|)} is VALID [2022-02-20 19:30:49,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(= |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; {494#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(= |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); {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {470#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~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; {484#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:30:49,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {470#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {470#true} is VALID [2022-02-20 19:30:49,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {470#true} is VALID [2022-02-20 19:30:49,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#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); {470#true} is VALID [2022-02-20 19:30:49,806 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:30:49,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:30:49,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982464613] [2022-02-20 19:30:49,806 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:30:49,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166497520] [2022-02-20 19:30:49,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166497520] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:30:49,807 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:30:49,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-02-20 19:30:49,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246452833] [2022-02-20 19:30:49,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:30:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:49,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:30:49,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:49,819 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:30:49,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:30:49,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:30:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:30:49,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:30:49,821 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:50,021 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:30:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:30:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:30:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 19:30:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 19:30:50,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-02-20 19:30:50,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:30:50,079 INFO L225 Difference]: With dead ends: 39 [2022-02-20 19:30:50,079 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 19:30:50,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:30:50,082 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:30:50,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:30:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 19:30:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 19:30:50,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:30:50,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:50,087 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:50,087 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:50,089 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 19:30:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:30:50,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:30:50,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:30:50,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-02-20 19:30:50,091 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-02-20 19:30:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:30:50,093 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 19:30:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:30:50,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:30:50,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:30:50,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:30:50,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:30:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:30:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 19:30:50,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-02-20 19:30:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:30:50,096 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 19:30:50,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:30:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:30:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:30:50,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:30:50,097 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:30:50,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:30:50,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:30:50,314 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:30:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:30:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-02-20 19:30:50,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:30:50,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274585860] [2022-02-20 19:30:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:30:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:30:50,330 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:30:50,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607816491] [2022-02-20 19:30:50,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:30:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:30:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:30:50,332 INFO L229 MonitoredProcess]: Starting monitored process 5 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:30:50,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 19:30:55,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:30:55,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:30:55,556 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 19:30:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 19:30:57,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:31:38,969 WARN L228 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-20 19:31:38,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {708#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); {708#true} is VALID [2022-02-20 19:31:38,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {708#true} is VALID [2022-02-20 19:31:38,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {708#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {719#(and (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_main1_~y~0#1| 127))} is VALID [2022-02-20 19:31:38,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {719#(and (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_main1_~y~0#1| 127))} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~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; {723#(and (<= |ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |ULTIMATE.start_gcd_test_~a#1| 128)) (<= |ULTIMATE.start_gcd_test_~a#1| 127) (= (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 0) (< 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:31:38,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {723#(and (<= |ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |ULTIMATE.start_gcd_test_~a#1| 128)) (<= |ULTIMATE.start_gcd_test_~a#1| 127) (= (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 0) (< 0 |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); {727#(and (<= |ULTIMATE.start_gcd_test_~b#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_gcd_test_~b#1|) 0) (or (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127)) (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))))) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (< 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:31:38,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#(and (<= |ULTIMATE.start_gcd_test_~b#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_gcd_test_~b#1|) 0) (or (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127)) (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))))) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (< 0 |ULTIMATE.start_gcd_test_~b#1|))} assume !(gcd_test_~b#1 < 0); {727#(and (<= |ULTIMATE.start_gcd_test_~b#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_gcd_test_~b#1|) 0) (or (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127)) (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))))) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (< 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:31:41,002 WARN L290 TraceCheckUtils]: 6: Hoare triple {727#(and (<= |ULTIMATE.start_gcd_test_~b#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_gcd_test_~b#1|) 0) (or (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) 127)) (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))))) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (< 0 |ULTIMATE.start_gcd_test_~b#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; {734#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= |ULTIMATE.start_gcd_test_~a#1| 127) (< 0 |ULTIMATE.start_gcd_test_~a#1|))} is UNKNOWN [2022-02-20 19:31:43,005 WARN L290 TraceCheckUtils]: 7: Hoare triple {734#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= |ULTIMATE.start_gcd_test_~a#1| 127) (< 0 |ULTIMATE.start_gcd_test_~a#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; {709#false} is UNKNOWN [2022-02-20 19:31:43,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#false} assume !(0 != gcd_test_~b#1); {709#false} is VALID [2022-02-20 19:31:43,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#false} gcd_test_#res#1 := gcd_test_~a#1; {709#false} is VALID [2022-02-20 19:31:43,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#false} 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;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {709#false} is VALID [2022-02-20 19:31:43,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#false} assume 0 == __VERIFIER_assert_~cond#1; {709#false} is VALID [2022-02-20 19:31:43,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#false} assume !false; {709#false} is VALID [2022-02-20 19:31:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:31:43,006 INFO L328 TraceCheckSpWp]: Computing backward predicates...