./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_2.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_4+newton_3_2.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 19e5e10e8b882a2339014fe22e262bc9b50fc611ccb496d82df2ea8022cd18a7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:36:59,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:36:59,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:36:59,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:36:59,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:36:59,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:36:59,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:36:59,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:36:59,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:36:59,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:36:59,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:36:59,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:36:59,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:36:59,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:36:59,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:36:59,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:36:59,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:36:59,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:36:59,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:36:59,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:36:59,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:36:59,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:36:59,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:36:59,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:36:59,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:36:59,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:36:59,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:36:59,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:36:59,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:36:59,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:36:59,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:36:59,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:36:59,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:36:59,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:36:59,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:36:59,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:36:59,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:36:59,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:36:59,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:36:59,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:36:59,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:36:59,476 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:36:59,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:36:59,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:36:59,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:36:59,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:36:59,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:36:59,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:36:59,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:36:59,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:36:59,493 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:36:59,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:36:59,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:36:59,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:36:59,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:36:59,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:36:59,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:36:59,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:36:59,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:36:59,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:36:59,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:36:59,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:36:59,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:36:59,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:36:59,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:36:59,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:36:59,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:36:59,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:36:59,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:36:59,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:36:59,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:36:59,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:36:59,497 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:36:59,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:36:59,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:36:59,497 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 -> 19e5e10e8b882a2339014fe22e262bc9b50fc611ccb496d82df2ea8022cd18a7 [2022-02-20 19:36:59,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:36:59,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:36:59,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:36:59,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:36:59,675 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:36:59,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_2.i [2022-02-20 19:36:59,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2fb4242/e720a9f5e04c490c9fec23c73e524eea/FLAG28f32e7b9 [2022-02-20 19:37:00,081 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:37:00,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_2.i [2022-02-20 19:37:00,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2fb4242/e720a9f5e04c490c9fec23c73e524eea/FLAG28f32e7b9 [2022-02-20 19:37:00,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2fb4242/e720a9f5e04c490c9fec23c73e524eea [2022-02-20 19:37:00,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:37:00,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:37:00,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:37:00,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:37:00,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:37:00,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407ede65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00, skipping insertion in model container [2022-02-20 19:37:00,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:37:00,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:37:00,662 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_4+newton_3_2.i[1224,1237] [2022-02-20 19:37:00,690 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_4+newton_3_2.i[2848,2861] [2022-02-20 19:37:00,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:37:00,706 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:37:00,724 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_4+newton_3_2.i[1224,1237] [2022-02-20 19:37:00,736 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_4+newton_3_2.i[2848,2861] [2022-02-20 19:37:00,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:37:00,749 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:37:00,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00 WrapperNode [2022-02-20 19:37:00,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:37:00,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:37:00,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:37:00,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:37:00,757 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:37:00" (1/1) ... [2022-02-20 19:37:00,770 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:37:00" (1/1) ... [2022-02-20 19:37:00,804 INFO L137 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 77 [2022-02-20 19:37:00,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:37:00,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:37:00,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:37:00,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:37:00,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:37:00,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:37:00,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:37:00,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:37:00,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (1/1) ... [2022-02-20 19:37:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:37:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:00,872 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:37:00,892 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:37:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:37:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:37:00,919 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:37:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:37:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:37:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:37:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:37:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:37:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 19:37:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 19:37:00,963 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:37:00,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:37:01,182 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:37:01,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:37:01,190 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:37:01,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:37:01 BoogieIcfgContainer [2022-02-20 19:37:01,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:37:01,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:37:01,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:37:01,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:37:01,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:37:00" (1/3) ... [2022-02-20 19:37:01,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60082209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:37:01, skipping insertion in model container [2022-02-20 19:37:01,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:37:00" (2/3) ... [2022-02-20 19:37:01,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60082209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:37:01, skipping insertion in model container [2022-02-20 19:37:01,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:37:01" (3/3) ... [2022-02-20 19:37:01,205 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_2.i [2022-02-20 19:37:01,213 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:37:01,213 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:37:01,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:37:01,259 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:37:01,260 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:37:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 19:37:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:37:01,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:01,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:01,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2022-02-20 19:37:01,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:01,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231331276] [2022-02-20 19:37:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:01,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#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); {49#true} is VALID [2022-02-20 19:37:01,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {49#true} is VALID [2022-02-20 19:37:01,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {49#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {51#(and (<= 63 |ULTIMATE.start_main1_~x~0#1|) (= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0))} is VALID [2022-02-20 19:37:01,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#(and (<= 63 |ULTIMATE.start_main1_~x~0#1|) (= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0))} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := -gcd_test_~a#1; {50#false} is VALID [2022-02-20 19:37:01,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#false} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := -gcd_test_~b#1; {50#false} is VALID [2022-02-20 19:37:01,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {50#false} assume 0 == gcd_test_~a#1;gcd_test_#res#1 := gcd_test_~b#1; {50#false} is VALID [2022-02-20 19:37:01,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {50#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {50#false} is VALID [2022-02-20 19:37:01,460 INFO L272 TraceCheckUtils]: 7: Hoare triple {50#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {50#false} is VALID [2022-02-20 19:37:01,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#false} ~cond := #in~cond; {50#false} is VALID [2022-02-20 19:37:01,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#false} assume 0 == ~cond; {50#false} is VALID [2022-02-20 19:37:01,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#false} assume !false; {50#false} is VALID [2022-02-20 19:37:01,462 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:37:01,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:01,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231331276] [2022-02-20 19:37:01,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231331276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:37:01,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:37:01,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:37:01,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349417950] [2022-02-20 19:37:01,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:37:01,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:37:01,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:01,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,483 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:37:01,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:37:01,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:37:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:37:01,500 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:01,620 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2022-02-20 19:37:01,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:37:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:37:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-20 19:37:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-20 19:37:01,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2022-02-20 19:37:01,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:01,774 INFO L225 Difference]: With dead ends: 99 [2022-02-20 19:37:01,775 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 19:37:01,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:37:01,784 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:01,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:37:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 19:37:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-02-20 19:37:01,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:01,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:01,816 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:01,818 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:01,828 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 19:37:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 19:37:01,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:01,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:01,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 46 states. [2022-02-20 19:37:01,832 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 46 states. [2022-02-20 19:37:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:01,844 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 19:37:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 19:37:01,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:01,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:01,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:01,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-02-20 19:37:01,855 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2022-02-20 19:37:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:01,856 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-02-20 19:37:01,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-02-20 19:37:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:37:01,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:01,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:01,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:37:01,861 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2022-02-20 19:37:01,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:01,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200769588] [2022-02-20 19:37:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:01,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#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); {336#true} is VALID [2022-02-20 19:37:01,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {336#true} is VALID [2022-02-20 19:37:01,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {338#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} is VALID [2022-02-20 19:37:01,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {338#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} assume !(gcd_test_~a#1 < 0); {338#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} is VALID [2022-02-20 19:37:01,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {338#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := -gcd_test_~b#1; {337#false} is VALID [2022-02-20 19:37:01,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#false} assume !(0 == gcd_test_~a#1); {337#false} is VALID [2022-02-20 19:37:01,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#false} assume !(0 != gcd_test_~b#1); {337#false} is VALID [2022-02-20 19:37:01,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#false} gcd_test_#res#1 := gcd_test_~a#1; {337#false} is VALID [2022-02-20 19:37:01,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {337#false} is VALID [2022-02-20 19:37:01,909 INFO L272 TraceCheckUtils]: 9: Hoare triple {337#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {337#false} is VALID [2022-02-20 19:37:01,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2022-02-20 19:37:01,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2022-02-20 19:37:01,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#false} assume !false; {337#false} is VALID [2022-02-20 19:37:01,910 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:37:01,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:01,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200769588] [2022-02-20 19:37:01,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200769588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:37:01,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:37:01,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:37:01,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007054988] [2022-02-20 19:37:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:37:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 19:37:01,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:01,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:01,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:37:01,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:01,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:37:01,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:37:01,928 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:01,984 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-02-20 19:37:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:37:01,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 19:37:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-20 19:37:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-20 19:37:01,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-02-20 19:37:02,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:02,045 INFO L225 Difference]: With dead ends: 55 [2022-02-20 19:37:02,045 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 19:37:02,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:37:02,049 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:02,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:37:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 19:37:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 19:37:02,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:02,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,054 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,054 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:02,056 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 19:37:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 19:37:02,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:02,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:02,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-02-20 19:37:02,057 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-02-20 19:37:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:02,059 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 19:37:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 19:37:02,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:02,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:02,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:02,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-02-20 19:37:02,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2022-02-20 19:37:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:02,063 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-02-20 19:37:02,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 19:37:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 19:37:02,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:02,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:02,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:37:02,073 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2022-02-20 19:37:02,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:02,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755151927] [2022-02-20 19:37:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:02,095 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:37:02,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281532267] [2022-02-20 19:37:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:02,103 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:37:02,105 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:37:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:02,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 19:37:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:02,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:37:02,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#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); {555#true} is VALID [2022-02-20 19:37:02,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {555#true} is VALID [2022-02-20 19:37:02,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:02,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:02,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:02,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:02,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:02,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {582#(<= (+ |ULTIMATE.start_gcd_test_~b#1| 45) 0)} is VALID [2022-02-20 19:37:02,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#(<= (+ |ULTIMATE.start_gcd_test_~b#1| 45) 0)} assume !(0 != gcd_test_~b#1); {556#false} is VALID [2022-02-20 19:37:02,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#false} gcd_test_#res#1 := gcd_test_~a#1; {556#false} is VALID [2022-02-20 19:37:02,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {556#false} is VALID [2022-02-20 19:37:02,299 INFO L272 TraceCheckUtils]: 11: Hoare triple {556#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {556#false} is VALID [2022-02-20 19:37:02,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2022-02-20 19:37:02,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#false} assume 0 == ~cond; {556#false} is VALID [2022-02-20 19:37:02,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#false} assume !false; {556#false} is VALID [2022-02-20 19:37:02,300 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:37:02,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:37:02,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#false} assume !false; {556#false} is VALID [2022-02-20 19:37:02,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#false} assume 0 == ~cond; {556#false} is VALID [2022-02-20 19:37:02,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2022-02-20 19:37:02,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {556#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {556#false} is VALID [2022-02-20 19:37:02,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {556#false} is VALID [2022-02-20 19:37:02,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#false} gcd_test_#res#1 := gcd_test_~a#1; {556#false} is VALID [2022-02-20 19:37:02,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} assume !(0 != gcd_test_~b#1); {556#false} is VALID [2022-02-20 19:37:02,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {622#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:02,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:02,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(0 == gcd_test_~a#1); {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:02,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~b#1 < 0); {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:02,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 < 0); {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:02,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {626#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:02,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {555#true} is VALID [2022-02-20 19:37:02,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#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); {555#true} is VALID [2022-02-20 19:37:02,417 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:37:02,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:02,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755151927] [2022-02-20 19:37:02,417 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:37:02,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281532267] [2022-02-20 19:37:02,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281532267] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:37:02,418 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:37:02,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 19:37:02,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101279475] [2022-02-20 19:37:02,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:37:02,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 19:37:02,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:02,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:02,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:02,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:37:02,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:02,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:37:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:37:02,433 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:02,532 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-02-20 19:37:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:37:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 19:37:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-02-20 19:37:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-02-20 19:37:02,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2022-02-20 19:37:02,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:02,579 INFO L225 Difference]: With dead ends: 58 [2022-02-20 19:37:02,579 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 19:37:02,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:37:02,580 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:02,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:37:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 19:37:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 19:37:02,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:02,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,586 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,587 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:02,588 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-02-20 19:37:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-02-20 19:37:02,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:02,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:02,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-02-20 19:37:02,589 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-02-20 19:37:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:02,591 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-02-20 19:37:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-02-20 19:37:02,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:02,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:02,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:02,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-02-20 19:37:02,594 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 15 [2022-02-20 19:37:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:02,594 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-02-20 19:37:02,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-02-20 19:37:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 19:37:02,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:02,595 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:02,615 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:37:02,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:02,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1992824063, now seen corresponding path program 1 times [2022-02-20 19:37:02,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:02,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595671355] [2022-02-20 19:37:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:02,840 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:37:02,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376866514] [2022-02-20 19:37:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:02,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:02,848 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:37:02,851 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:37:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:02,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 19:37:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:02,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:37:03,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#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); {880#true} is VALID [2022-02-20 19:37:03,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {880#true} is VALID [2022-02-20 19:37:03,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {891#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {907#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {907#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {914#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {914#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {914#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:03,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {921#(<= (div (+ (- 45) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 2)) 18)} is VALID [2022-02-20 19:37:03,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(<= (div (+ (- 45) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 2)) 18)} assume !(0 != gcd_test_~b#1); {881#false} is VALID [2022-02-20 19:37:03,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} gcd_test_#res#1 := gcd_test_~a#1; {881#false} is VALID [2022-02-20 19:37:03,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {881#false} is VALID [2022-02-20 19:37:03,309 INFO L272 TraceCheckUtils]: 15: Hoare triple {881#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {881#false} is VALID [2022-02-20 19:37:03,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2022-02-20 19:37:03,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2022-02-20 19:37:03,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-02-20 19:37:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:03,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:37:03,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-02-20 19:37:03,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2022-02-20 19:37:03,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2022-02-20 19:37:03,469 INFO L272 TraceCheckUtils]: 15: Hoare triple {881#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {881#false} is VALID [2022-02-20 19:37:03,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {881#false} is VALID [2022-02-20 19:37:03,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} gcd_test_#res#1 := gcd_test_~a#1; {881#false} is VALID [2022-02-20 19:37:03,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} assume !(0 != gcd_test_~b#1); {881#false} is VALID [2022-02-20 19:37:03,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {965#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {961#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:03,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {965#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {965#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {965#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {972#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {972#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !(0 == gcd_test_~a#1); {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~b#1 < 0); {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 < 0); {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {979#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:03,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {880#true} is VALID [2022-02-20 19:37:03,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#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); {880#true} is VALID [2022-02-20 19:37:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:03,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:03,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595671355] [2022-02-20 19:37:03,479 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:37:03,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376866514] [2022-02-20 19:37:03,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376866514] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:37:03,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:37:03,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 19:37:03,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106442051] [2022-02-20 19:37:03,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:37:03,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 19:37:03,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:03,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:03,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:03,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:37:03,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:37:03,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:37:03,505 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:03,670 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-02-20 19:37:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:37:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 19:37:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-02-20 19:37:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-02-20 19:37:03,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-02-20 19:37:03,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:03,721 INFO L225 Difference]: With dead ends: 60 [2022-02-20 19:37:03,721 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 19:37:03,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:37:03,722 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:03,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 190 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:37:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 19:37:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 19:37:03,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:03,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:03,730 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:03,730 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:03,732 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 19:37:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 19:37:03,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:03,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:03,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 19:37:03,733 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 19:37:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:03,734 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 19:37:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 19:37:03,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:03,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:03,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:03,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-02-20 19:37:03,737 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 19 [2022-02-20 19:37:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:03,737 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-02-20 19:37:03,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-02-20 19:37:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 19:37:03,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:03,738 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:03,757 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:37:03,951 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,SelfDestructingSolverStorable3 [2022-02-20 19:37:03,952 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2022-02-20 19:37:03,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:03,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404743720] [2022-02-20 19:37:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:03,977 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:37:03,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496025084] [2022-02-20 19:37:03,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:37:03,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:03,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:04,007 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:37:04,026 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:37:04,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:37:04,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:37:04,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 19:37:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:04,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:37:35,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {1247#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); {1247#true} is VALID [2022-02-20 19:37:35,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1247#true} is VALID [2022-02-20 19:37:35,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {1247#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:37:35,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~a#1 < 0); {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:37:35,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~b#1 < 0); {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:37:35,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(0 == gcd_test_~a#1); {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:37:35,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !!(0 != gcd_test_~b#1); {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:37:35,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1274#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:35,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1274#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {1274#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:35,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1274#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1281#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-20 19:37:35,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {1281#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume !!(0 != gcd_test_~b#1); {1281#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-20 19:37:35,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1281#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1288#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:35,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {1288#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {1288#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:35,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1288#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1295#(<= 18 (div (+ |ULTIMATE.start_gcd_test_~b#1| 45) 3))} is VALID [2022-02-20 19:37:35,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#(<= 18 (div (+ |ULTIMATE.start_gcd_test_~b#1| 45) 3))} assume !(0 != gcd_test_~b#1); {1248#false} is VALID [2022-02-20 19:37:35,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#false} gcd_test_#res#1 := gcd_test_~a#1; {1248#false} is VALID [2022-02-20 19:37:35,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {1248#false} is VALID [2022-02-20 19:37:35,264 INFO L272 TraceCheckUtils]: 17: Hoare triple {1248#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {1248#false} is VALID [2022-02-20 19:37:35,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {1248#false} ~cond := #in~cond; {1248#false} is VALID [2022-02-20 19:37:35,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {1248#false} assume 0 == ~cond; {1248#false} is VALID [2022-02-20 19:37:35,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1248#false} assume !false; {1248#false} is VALID [2022-02-20 19:37:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:35,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:37:35,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {1248#false} assume !false; {1248#false} is VALID [2022-02-20 19:37:35,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {1248#false} assume 0 == ~cond; {1248#false} is VALID [2022-02-20 19:37:35,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {1248#false} ~cond := #in~cond; {1248#false} is VALID [2022-02-20 19:37:35,426 INFO L272 TraceCheckUtils]: 17: Hoare triple {1248#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {1248#false} is VALID [2022-02-20 19:37:35,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {1248#false} is VALID [2022-02-20 19:37:35,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#false} gcd_test_#res#1 := gcd_test_~a#1; {1248#false} is VALID [2022-02-20 19:37:35,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {1335#(not (<= |ULTIMATE.start_gcd_test_~b#1| 0))} assume !(0 != gcd_test_~b#1); {1248#false} is VALID [2022-02-20 19:37:35,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1335#(not (<= |ULTIMATE.start_gcd_test_~b#1| 0))} is VALID [2022-02-20 19:37:35,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !!(0 != gcd_test_~b#1); {1339#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:37:35,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {1346#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1339#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:37:35,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {1346#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} assume !!(0 != gcd_test_~b#1); {1346#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} is VALID [2022-02-20 19:37:35,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1353#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1346#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} is VALID [2022-02-20 19:37:35,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1353#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} assume !!(0 != gcd_test_~b#1); {1353#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} is VALID [2022-02-20 19:37:35,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1353#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} is VALID [2022-02-20 19:37:35,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !!(0 != gcd_test_~b#1); {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:37:35,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !(0 == gcd_test_~a#1); {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:37:35,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !(gcd_test_~b#1 < 0); {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:37:35,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !(gcd_test_~a#1 < 0); {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:37:35,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {1247#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1360#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:37:35,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1247#true} is VALID [2022-02-20 19:37:35,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {1247#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); {1247#true} is VALID [2022-02-20 19:37:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:35,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:35,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404743720] [2022-02-20 19:37:35,436 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:37:35,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496025084] [2022-02-20 19:37:35,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496025084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:37:35,436 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:37:35,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-20 19:37:35,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757619382] [2022-02-20 19:37:35,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:37:35,437 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 19:37:35,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:35,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:35,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:35,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 19:37:35,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 19:37:35,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:37:35,475 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:35,769 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-02-20 19:37:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:37:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 19:37:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-02-20 19:37:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-02-20 19:37:35,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2022-02-20 19:37:35,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:35,828 INFO L225 Difference]: With dead ends: 68 [2022-02-20 19:37:35,828 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 19:37:35,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:37:35,829 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:35,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:37:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 19:37:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 19:37:35,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:35,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:35,844 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:35,844 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:35,845 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-02-20 19:37:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-02-20 19:37:35,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:35,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:35,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-02-20 19:37:35,846 INFO L87 Difference]: Start difference. First operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-02-20 19:37:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:35,848 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-02-20 19:37:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-02-20 19:37:35,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:35,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:35,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:35,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 19:37:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-02-20 19:37:35,850 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 21 [2022-02-20 19:37:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:35,851 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-02-20 19:37:35,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-02-20 19:37:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 19:37:35,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:35,852 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:35,877 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:37:36,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:36,077 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1120707465, now seen corresponding path program 3 times [2022-02-20 19:37:36,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:36,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271129361] [2022-02-20 19:37:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:36,097 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:37:36,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854997380] [2022-02-20 19:37:36,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 19:37:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:36,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:36,120 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:37:36,121 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:37:36,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 19:37:36,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:37:36,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 19:37:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:36,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:37:36,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {1661#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); {1661#true} is VALID [2022-02-20 19:37:36,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1661#true} is VALID [2022-02-20 19:37:36,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1672#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:36,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1707#(and (= |ULTIMATE.start_gcd_test_~b#1| (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)) (= |ULTIMATE.start_main1_~x~0#1| 63))} is VALID [2022-02-20 19:37:36,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {1707#(and (= |ULTIMATE.start_gcd_test_~b#1| (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)) (= |ULTIMATE.start_main1_~x~0#1| 63))} assume !!(0 != gcd_test_~b#1); {1707#(and (= |ULTIMATE.start_gcd_test_~b#1| (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)) (= |ULTIMATE.start_main1_~x~0#1| 63))} is VALID [2022-02-20 19:37:36,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {1707#(and (= |ULTIMATE.start_gcd_test_~b#1| (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)) (= |ULTIMATE.start_main1_~x~0#1| 63))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1714#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)))} is VALID [2022-02-20 19:37:36,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {1714#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)))} assume !(0 != gcd_test_~b#1); {1718#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~a#1| (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)))} is VALID [2022-02-20 19:37:36,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {1718#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= |ULTIMATE.start_gcd_test_~a#1| (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 18)))} gcd_test_#res#1 := gcd_test_~a#1; {1722#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= 9 |ULTIMATE.start_gcd_test_#res#1|))} is VALID [2022-02-20 19:37:36,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= 9 |ULTIMATE.start_gcd_test_#res#1|))} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {1726#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= 9 |ULTIMATE.start_main1_~g~0#1|))} is VALID [2022-02-20 19:37:36,480 INFO L272 TraceCheckUtils]: 19: Hoare triple {1726#(and (= |ULTIMATE.start_main1_~x~0#1| 63) (= 9 |ULTIMATE.start_main1_~g~0#1|))} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {1730#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 19:37:36,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {1730#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1734#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 19:37:36,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {1734#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-02-20 19:37:36,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-02-20 19:37:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 19:37:36,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:37:36,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-02-20 19:37:36,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {1734#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-02-20 19:37:36,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {1730#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1734#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 19:37:36,955 INFO L272 TraceCheckUtils]: 19: Hoare triple {1750#(= (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_main1_~g~0#1|) 0)} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {1730#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 19:37:36,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {1754#(= (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 0)} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {1750#(= (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_main1_~g~0#1|) 0)} is VALID [2022-02-20 19:37:36,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {1758#(= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|))} gcd_test_#res#1 := gcd_test_~a#1; {1754#(= (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 0)} is VALID [2022-02-20 19:37:36,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1762#(or (not (= |ULTIMATE.start_gcd_test_~b#1| 0)) (= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !(0 != gcd_test_~b#1); {1758#(= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-20 19:37:36,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {1766#(or (not (= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| (- 1))) 0)) (= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1762#(or (not (= |ULTIMATE.start_gcd_test_~b#1| 0)) (= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-20 19:37:36,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1766#(or (not (= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| (- 1))) 0)) (= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !!(0 != gcd_test_~b#1); {1766#(or (not (= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| (- 1))) 0)) (= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-20 19:37:36,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1766#(or (not (= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| (- 1))) 0)) (= 0 (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-20 19:37:36,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !!(0 != gcd_test_~b#1); {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !!(0 != gcd_test_~b#1); {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !!(0 != gcd_test_~b#1); {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1773#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !!(0 != gcd_test_~b#1); {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !(0 == gcd_test_~a#1); {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !(gcd_test_~b#1 < 0); {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} assume !(gcd_test_~a#1 < 0); {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1792#(or (= (mod |ULTIMATE.start_main1_~x~0#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) 0) (not (< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (not (= (mod |ULTIMATE.start_gcd_test_~b#1| 2) 0)))} is VALID [2022-02-20 19:37:36,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {1661#true} is VALID [2022-02-20 19:37:36,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {1661#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); {1661#true} is VALID [2022-02-20 19:37:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 19:37:36,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:36,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271129361] [2022-02-20 19:37:36,972 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:37:36,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854997380] [2022-02-20 19:37:36,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854997380] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:37:36,972 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:37:36,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-02-20 19:37:36,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580700144] [2022-02-20 19:37:36,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:37:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 19:37:36,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:36,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:37,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:37,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 19:37:37,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:37,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 19:37:37,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:37:37,020 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:39,693 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2022-02-20 19:37:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 19:37:39,693 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 19:37:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2022-02-20 19:37:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2022-02-20 19:37:39,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 94 transitions. [2022-02-20 19:37:39,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:39,804 INFO L225 Difference]: With dead ends: 81 [2022-02-20 19:37:39,804 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 19:37:39,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-02-20 19:37:39,805 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:39,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 388 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:37:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 19:37:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2022-02-20 19:37:39,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:39,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:39,828 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:39,828 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:39,830 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-02-20 19:37:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-02-20 19:37:39,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:39,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:39,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 78 states. [2022-02-20 19:37:39,831 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 78 states. [2022-02-20 19:37:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:39,833 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-02-20 19:37:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-02-20 19:37:39,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:39,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:39,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:39,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-02-20 19:37:39,836 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2022-02-20 19:37:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:39,836 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-02-20 19:37:39,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-02-20 19:37:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 19:37:39,837 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:39,837 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:39,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:37:40,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:40,054 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 469106930, now seen corresponding path program 4 times [2022-02-20 19:37:40,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:40,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114676352] [2022-02-20 19:37:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:40,067 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:37:40,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18170414] [2022-02-20 19:37:40,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 19:37:40,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:40,069 INFO L229 MonitoredProcess]: Starting monitored process 6 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:37:40,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 19:37:40,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 19:37:40,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:37:40,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 19:37:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:40,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:37:40,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {2210#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); {2210#true} is VALID [2022-02-20 19:37:40,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {2210#true} is VALID [2022-02-20 19:37:40,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {2221#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {2237#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {2237#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {2237#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {2237#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {2244#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {2244#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {2244#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {2244#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {2251#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {2251#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {2251#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:37:40,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {2251#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {2258#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} is VALID [2022-02-20 19:37:40,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {2258#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} assume !!(0 != gcd_test_~b#1); {2258#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} is VALID [2022-02-20 19:37:40,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {2258#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {2265#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2)) 18))} is VALID [2022-02-20 19:37:40,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2)) 18))} assume !!(0 != gcd_test_~b#1); {2265#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2)) 18))} is VALID [2022-02-20 19:37:40,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {2265#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2)) 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {2272#(<= (div (div (+ (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 171)) 3) (- 3)) 18)} is VALID [2022-02-20 19:37:40,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(<= (div (div (+ (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 171)) 3) (- 3)) 18)} assume !(0 != gcd_test_~b#1); {2211#false} is VALID [2022-02-20 19:37:40,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {2211#false} gcd_test_#res#1 := gcd_test_~a#1; {2211#false} is VALID [2022-02-20 19:37:40,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {2211#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {2211#false} is VALID [2022-02-20 19:37:40,652 INFO L272 TraceCheckUtils]: 21: Hoare triple {2211#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {2211#false} is VALID [2022-02-20 19:37:40,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-02-20 19:37:40,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-02-20 19:37:40,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-02-20 19:37:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:40,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:37:41,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-02-20 19:37:41,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-02-20 19:37:41,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-02-20 19:37:41,069 INFO L272 TraceCheckUtils]: 21: Hoare triple {2211#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {2211#false} is VALID [2022-02-20 19:37:41,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {2211#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {2211#false} is VALID [2022-02-20 19:37:41,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {2211#false} gcd_test_#res#1 := gcd_test_~a#1; {2211#false} is VALID [2022-02-20 19:37:41,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {2312#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} assume !(0 != gcd_test_~b#1); {2211#false} is VALID [2022-02-20 19:37:41,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {2316#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {2312#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:37:41,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {2316#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {2316#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:41,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {2323#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {2316#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:37:41,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {2323#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} assume !!(0 != gcd_test_~b#1); {2323#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} is VALID [2022-02-20 19:37:41,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {2330#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 3))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {2323#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} is VALID [2022-02-20 19:37:41,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {2330#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 3))} assume !!(0 != gcd_test_~b#1); {2330#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 3))} is VALID [2022-02-20 19:37:41,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {2337#(< (+ |ULTIMATE.start_gcd_test_~b#1| (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3))) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {2330#(< |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 3))} is VALID [2022-02-20 19:37:41,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {2337#(< (+ |ULTIMATE.start_gcd_test_~b#1| (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3))) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume !!(0 != gcd_test_~b#1); {2337#(< (+ |ULTIMATE.start_gcd_test_~b#1| (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3))) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {2344#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 2)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {2337#(< (+ |ULTIMATE.start_gcd_test_~b#1| (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3))) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {2344#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 2)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume !!(0 != gcd_test_~b#1); {2344#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 2)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {2344#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 2)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume !!(0 != gcd_test_~b#1); {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume !(0 == gcd_test_~a#1); {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume !(gcd_test_~b#1 < 0); {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} assume !(gcd_test_~a#1 < 0); {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;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_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {2351#(< (+ (div (+ (- 1) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 3)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) (+ |ULTIMATE.start_gcd_test_~a#1| 1))} is VALID [2022-02-20 19:37:41,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {2210#true} is VALID [2022-02-20 19:37:41,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {2210#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); {2210#true} is VALID [2022-02-20 19:37:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:41,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:37:41,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114676352] [2022-02-20 19:37:41,077 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:37:41,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18170414] [2022-02-20 19:37:41,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18170414] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:37:41,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:37:41,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-02-20 19:37:41,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955790869] [2022-02-20 19:37:41,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:37:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 19:37:41,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:41,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:41,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:41,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 19:37:41,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:37:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 19:37:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:37:41,125 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:41,691 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-02-20 19:37:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:37:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 19:37:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2022-02-20 19:37:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2022-02-20 19:37:41,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 86 transitions. [2022-02-20 19:37:41,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:41,745 INFO L225 Difference]: With dead ends: 94 [2022-02-20 19:37:41,745 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 19:37:41,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-02-20 19:37:41,746 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:41,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 448 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:37:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 19:37:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 19:37:41,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:41,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:41,768 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:41,769 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:41,771 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-02-20 19:37:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-02-20 19:37:41,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:41,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:41,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-02-20 19:37:41,772 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-02-20 19:37:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:41,784 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-02-20 19:37:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-02-20 19:37:41,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:41,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:41,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:41,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 19:37:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-02-20 19:37:41,786 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 25 [2022-02-20 19:37:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:41,786 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-02-20 19:37:41,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-02-20 19:37:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 19:37:41,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:41,787 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:41,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 19:37:42,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:42,003 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2022-02-20 19:37:42,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:37:42,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055056193] [2022-02-20 19:37:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:37:42,015 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:37:42,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146184939] [2022-02-20 19:37:42,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 19:37:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:37:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:37:42,035 INFO L229 MonitoredProcess]: Starting monitored process 7 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:37:42,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 19:37:42,081 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-02-20 19:37:42,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:37:42,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 19:37:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:42,090 INFO L286 TraceCheckSpWp]: Computing forward predicates...