./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/gcd_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:58:48,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:58:48,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:58:48,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:58:48,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:58:48,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:58:48,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:58:48,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:58:48,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:58:48,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:58:48,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:58:48,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:58:48,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:58:48,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:58:48,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:58:48,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:58:48,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:58:48,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:58:48,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:58:48,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:58:48,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:58:48,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:58:48,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:58:48,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:58:48,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:58:48,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:58:48,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:58:48,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:58:48,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:58:48,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:58:48,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:58:48,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:58:48,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:58:48,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:58:48,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:58:48,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:58:48,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:58:48,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:58:48,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:58:48,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:58:48,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:58:48,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:58:48,234 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:58:48,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:58:48,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:58:48,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:58:48,238 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:58:48,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:58:48,239 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:58:48,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:58:48,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:58:48,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:58:48,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:58:48,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:58:48,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:58:48,242 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:58:48,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:58:48,243 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:58:48,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:58:48,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:58:48,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:58:48,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:58:48,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:58:48,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:58:48,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:58:48,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:58:48,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:58:48,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:58:48,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:58:48,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:58:48,247 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:58:48,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2020-07-28 14:58:48,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:58:48,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:58:48,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:58:48,590 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:58:48,591 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:58:48,592 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2020-07-28 14:58:48,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e16c436e/71d0a83929e945a0a0cd1b16748c3bf6/FLAGed0f24b33 [2020-07-28 14:58:49,119 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:58:49,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2020-07-28 14:58:49,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e16c436e/71d0a83929e945a0a0cd1b16748c3bf6/FLAGed0f24b33 [2020-07-28 14:58:49,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e16c436e/71d0a83929e945a0a0cd1b16748c3bf6 [2020-07-28 14:58:49,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:58:49,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:58:49,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:58:49,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:58:49,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:58:49,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6f6723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49, skipping insertion in model container [2020-07-28 14:58:49,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:58:49,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:58:49,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:58:49,682 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:58:49,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:58:49,712 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:58:49,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49 WrapperNode [2020-07-28 14:58:49,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:58:49,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:58:49,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:58:49,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:58:49,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:58:49,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:58:49,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:58:49,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:58:49,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... [2020-07-28 14:58:49,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:58:49,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:58:49,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:58:49,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:58:49,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:58:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:58:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:58:50,187 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:58:50,187 INFO L295 CfgBuilder]: Removed 13 assume(true) statements. [2020-07-28 14:58:50,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:58:50 BoogieIcfgContainer [2020-07-28 14:58:50,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:58:50,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:58:50,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:58:50,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:58:50,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:58:49" (1/3) ... [2020-07-28 14:58:50,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bd4ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:58:50, skipping insertion in model container [2020-07-28 14:58:50,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:58:49" (2/3) ... [2020-07-28 14:58:50,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bd4ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:58:50, skipping insertion in model container [2020-07-28 14:58:50,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:58:50" (3/3) ... [2020-07-28 14:58:50,201 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2020-07-28 14:58:50,216 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:58:50,224 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-28 14:58:50,239 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 14:58:50,264 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:58:50,264 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:58:50,264 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:58:50,265 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:58:50,265 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:58:50,265 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:58:50,265 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:58:50,265 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:58:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-28 14:58:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 14:58:50,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:50,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:50,290 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:50,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:50,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1540385985, now seen corresponding path program 1 times [2020-07-28 14:58:50,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:50,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126231259] [2020-07-28 14:58:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:50,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {28#(= 63 ULTIMATE.start_gcd_test_~a)} is VALID [2020-07-28 14:58:50,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#(= 63 ULTIMATE.start_gcd_test_~a)} assume gcd_test_~a < 0;gcd_test_~a := -gcd_test_~a; {27#false} is VALID [2020-07-28 14:58:50,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#false} assume gcd_test_~b < 0;gcd_test_~b := -gcd_test_~b; {27#false} is VALID [2020-07-28 14:58:50,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {27#false} assume 0 == gcd_test_~a;gcd_test_#res := gcd_test_~b; {27#false} is VALID [2020-07-28 14:58:50,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27#false} is VALID [2020-07-28 14:58:50,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond; {27#false} is VALID [2020-07-28 14:58:50,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-28 14:58:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:50,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126231259] [2020-07-28 14:58:50,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:58:50,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:58:50,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793675402] [2020-07-28 14:58:50,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 14:58:50,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:50,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:58:50,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:50,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:58:50,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:58:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:50,569 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-28 14:58:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:50,732 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2020-07-28 14:58:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:58:50,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 14:58:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-28 14:58:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-28 14:58:50,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-28 14:58:50,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:50,926 INFO L225 Difference]: With dead ends: 63 [2020-07-28 14:58:50,927 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 14:58:50,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 14:58:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2020-07-28 14:58:50,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:50,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 19 states. [2020-07-28 14:58:50,977 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 19 states. [2020-07-28 14:58:50,977 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 19 states. [2020-07-28 14:58:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:50,982 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 14:58:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-28 14:58:50,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:50,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:50,983 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 34 states. [2020-07-28 14:58:50,984 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 34 states. [2020-07-28 14:58:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:50,987 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 14:58:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-28 14:58:50,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:50,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:50,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:50,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 14:58:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-28 14:58:50,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2020-07-28 14:58:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:50,995 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-28 14:58:50,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:58:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 14:58:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 14:58:50,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:50,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:50,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:58:50,997 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash 687615503, now seen corresponding path program 1 times [2020-07-28 14:58:50,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:50,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807915541] [2020-07-28 14:58:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:51,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {203#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {205#(= 18 ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-28 14:58:51,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {205#(= 18 ULTIMATE.start_gcd_test_~b)} assume !(gcd_test_~a < 0); {205#(= 18 ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-28 14:58:51,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {205#(= 18 ULTIMATE.start_gcd_test_~b)} assume gcd_test_~b < 0;gcd_test_~b := -gcd_test_~b; {204#false} is VALID [2020-07-28 14:58:51,040 INFO L280 TraceCheckUtils]: 3: Hoare triple {204#false} assume !(0 == gcd_test_~a); {204#false} is VALID [2020-07-28 14:58:51,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {204#false} assume !(0 != gcd_test_~b); {204#false} is VALID [2020-07-28 14:58:51,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {204#false} gcd_test_#res := gcd_test_~a; {204#false} is VALID [2020-07-28 14:58:51,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {204#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {204#false} is VALID [2020-07-28 14:58:51,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {204#false} assume 0 == __VERIFIER_assert_~cond; {204#false} is VALID [2020-07-28 14:58:51,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-28 14:58:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:51,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807915541] [2020-07-28 14:58:51,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:58:51,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:58:51,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960974221] [2020-07-28 14:58:51,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-28 14:58:51,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:51,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:58:51,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:51,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:58:51,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:51,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:58:51,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:51,068 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2020-07-28 14:58:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:51,151 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-28 14:58:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:58:51,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-28 14:58:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-28 14:58:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-28 14:58:51,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2020-07-28 14:58:51,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:51,221 INFO L225 Difference]: With dead ends: 37 [2020-07-28 14:58:51,221 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 14:58:51,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 14:58:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 14:58:51,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:51,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 14:58:51,231 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 14:58:51,231 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 14:58:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:51,233 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-28 14:58:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-28 14:58:51,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:51,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:51,234 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 14:58:51,235 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 14:58:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:51,237 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-28 14:58:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-28 14:58:51,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:51,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:51,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:51,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 14:58:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-28 14:58:51,240 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2020-07-28 14:58:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:51,240 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-28 14:58:51,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:58:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-28 14:58:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:58:51,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:51,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:51,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:58:51,242 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1672373068, now seen corresponding path program 1 times [2020-07-28 14:58:51,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:51,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662737056] [2020-07-28 14:58:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:51,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:51,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:51,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:51,297 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:51,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:51,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {324#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {323#false} is VALID [2020-07-28 14:58:51,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {323#false} assume !(0 != gcd_test_~b); {323#false} is VALID [2020-07-28 14:58:51,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {323#false} gcd_test_#res := gcd_test_~a; {323#false} is VALID [2020-07-28 14:58:51,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {323#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {323#false} is VALID [2020-07-28 14:58:51,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {323#false} assume 0 == __VERIFIER_assert_~cond; {323#false} is VALID [2020-07-28 14:58:51,301 INFO L280 TraceCheckUtils]: 10: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-28 14:58:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:51,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662737056] [2020-07-28 14:58:51,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:58:51,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:58:51,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501101529] [2020-07-28 14:58:51,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-28 14:58:51,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:51,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:58:51,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:51,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:58:51,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:51,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:58:51,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:51,329 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2020-07-28 14:58:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:51,389 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-28 14:58:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:58:51,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-28 14:58:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2020-07-28 14:58:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2020-07-28 14:58:51,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2020-07-28 14:58:51,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:51,454 INFO L225 Difference]: With dead ends: 38 [2020-07-28 14:58:51,454 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 14:58:51,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 14:58:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-28 14:58:51,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:51,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-28 14:58:51,465 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 14:58:51,465 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 14:58:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:51,467 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 14:58:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 14:58:51,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:51,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:51,469 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 14:58:51,469 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 14:58:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:51,472 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 14:58:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 14:58:51,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:51,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:51,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:51,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 14:58:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-28 14:58:51,476 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2020-07-28 14:58:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:51,476 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-28 14:58:51,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:58:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 14:58:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:58:51,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:51,478 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:51,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 14:58:51,479 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:51,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1034091127, now seen corresponding path program 1 times [2020-07-28 14:58:51,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:51,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762781955] [2020-07-28 14:58:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:51,497 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:58:51,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409131994] [2020-07-28 14:58:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:51,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 14:58:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:51,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:51,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {450#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:51,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:51,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:51,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,002 INFO L280 TraceCheckUtils]: 5: Hoare triple {455#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {471#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:52,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {471#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:52,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {471#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {478#(<= (div (+ (* ULTIMATE.start_gcd_test_~b (- 1)) (- 63)) (- 2)) 18)} is VALID [2020-07-28 14:58:52,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {478#(<= (div (+ (* ULTIMATE.start_gcd_test_~b (- 1)) (- 63)) (- 2)) 18)} assume !(0 != gcd_test_~b); {451#false} is VALID [2020-07-28 14:58:52,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {451#false} gcd_test_#res := gcd_test_~a; {451#false} is VALID [2020-07-28 14:58:52,007 INFO L280 TraceCheckUtils]: 10: Hoare triple {451#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {451#false} is VALID [2020-07-28 14:58:52,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {451#false} assume 0 == __VERIFIER_assert_~cond; {451#false} is VALID [2020-07-28 14:58:52,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {451#false} assume !false; {451#false} is VALID [2020-07-28 14:58:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:52,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762781955] [2020-07-28 14:58:52,010 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:58:52,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409131994] [2020-07-28 14:58:52,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:58:52,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-28 14:58:52,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105032873] [2020-07-28 14:58:52,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 14:58:52,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:52,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:58:52,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:52,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:58:52,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:58:52,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:58:52,034 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2020-07-28 14:58:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:52,198 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-28 14:58:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:58:52,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 14:58:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:58:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-28 14:58:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:58:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-28 14:58:52,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-28 14:58:52,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:52,265 INFO L225 Difference]: With dead ends: 40 [2020-07-28 14:58:52,265 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 14:58:52,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:58:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 14:58:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-28 14:58:52,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:52,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-28 14:58:52,285 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 14:58:52,285 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 14:58:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:52,287 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-28 14:58:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-28 14:58:52,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:52,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:52,288 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 14:58:52,288 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 14:58:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:52,292 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-28 14:58:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-28 14:58:52,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:52,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:52,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:52,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 14:58:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-28 14:58:52,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2020-07-28 14:58:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:52,297 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-28 14:58:52,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:58:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-28 14:58:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 14:58:52,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:52,299 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:52,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:52,501 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 803998854, now seen corresponding path program 2 times [2020-07-28 14:58:52,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:52,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295342967] [2020-07-28 14:58:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:52,515 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:58:52,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782391643] [2020-07-28 14:58:52,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:52,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:58:52,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:58:52,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 14:58:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:52,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:52,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,914 INFO L280 TraceCheckUtils]: 3: Hoare triple {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:52,916 INFO L280 TraceCheckUtils]: 5: Hoare triple {633#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {649#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:52,916 INFO L280 TraceCheckUtils]: 6: Hoare triple {649#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {649#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:52,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {649#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {656#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:52,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {656#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:52,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {663#(<= (div (+ (* ULTIMATE.start_gcd_test_~b (- 1)) (- 63)) (- 3)) 18)} is VALID [2020-07-28 14:58:52,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {663#(<= (div (+ (* ULTIMATE.start_gcd_test_~b (- 1)) (- 63)) (- 3)) 18)} assume !(0 != gcd_test_~b); {629#false} is VALID [2020-07-28 14:58:52,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {629#false} gcd_test_#res := gcd_test_~a; {629#false} is VALID [2020-07-28 14:58:52,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {629#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {629#false} is VALID [2020-07-28 14:58:52,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {629#false} assume 0 == __VERIFIER_assert_~cond; {629#false} is VALID [2020-07-28 14:58:52,924 INFO L280 TraceCheckUtils]: 14: Hoare triple {629#false} assume !false; {629#false} is VALID [2020-07-28 14:58:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:52,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295342967] [2020-07-28 14:58:52,925 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:58:52,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782391643] [2020-07-28 14:58:52,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:58:52,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-28 14:58:52,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977347416] [2020-07-28 14:58:52,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 14:58:52,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:52,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 14:58:52,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:52,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 14:58:52,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 14:58:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:58:52,964 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2020-07-28 14:58:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:53,176 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-28 14:58:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:58:53,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 14:58:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:58:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-28 14:58:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:58:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-28 14:58:53,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-28 14:58:53,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:53,265 INFO L225 Difference]: With dead ends: 42 [2020-07-28 14:58:53,265 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 14:58:53,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:58:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 14:58:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-28 14:58:53,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:53,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-28 14:58:53,285 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 14:58:53,286 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 14:58:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:53,287 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 14:58:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 14:58:53,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:53,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:53,288 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 14:58:53,289 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 14:58:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:53,290 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 14:58:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 14:58:53,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:53,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:53,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:53,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 14:58:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-28 14:58:53,293 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2020-07-28 14:58:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:53,294 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-28 14:58:53,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 14:58:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 14:58:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 14:58:53,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:53,295 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:53,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:53,508 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1976911939, now seen corresponding path program 3 times [2020-07-28 14:58:53,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:53,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918331562] [2020-07-28 14:58:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:53,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {825#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,667 INFO L280 TraceCheckUtils]: 3: Hoare triple {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,668 INFO L280 TraceCheckUtils]: 5: Hoare triple {827#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {828#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,670 INFO L280 TraceCheckUtils]: 6: Hoare triple {828#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {828#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,671 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {829#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,672 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {829#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:53,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {830#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-28 14:58:53,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {830#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !!(0 != gcd_test_~b); {830#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-28 14:58:53,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {830#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {831#(<= 9 ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-28 14:58:53,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {831#(<= 9 ULTIMATE.start_gcd_test_~b)} assume !(0 != gcd_test_~b); {826#false} is VALID [2020-07-28 14:58:53,682 INFO L280 TraceCheckUtils]: 13: Hoare triple {826#false} gcd_test_#res := gcd_test_~a; {826#false} is VALID [2020-07-28 14:58:53,682 INFO L280 TraceCheckUtils]: 14: Hoare triple {826#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {826#false} is VALID [2020-07-28 14:58:53,682 INFO L280 TraceCheckUtils]: 15: Hoare triple {826#false} assume 0 == __VERIFIER_assert_~cond; {826#false} is VALID [2020-07-28 14:58:53,683 INFO L280 TraceCheckUtils]: 16: Hoare triple {826#false} assume !false; {826#false} is VALID [2020-07-28 14:58:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:53,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918331562] [2020-07-28 14:58:53,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734968804] [2020-07-28 14:58:53,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:53,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-28 14:58:53,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:58:53,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 14:58:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:53,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:54,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {825#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:58:54,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~a < 0); {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:58:54,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~b < 0); {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:58:54,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(0 == gcd_test_~a); {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:58:54,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !!(0 != gcd_test_~b); {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:58:54,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {835#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {851#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:54,144 INFO L280 TraceCheckUtils]: 6: Hoare triple {851#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {851#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:54,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {851#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {858#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:54,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {858#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {858#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:54,149 INFO L280 TraceCheckUtils]: 9: Hoare triple {858#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {865#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:54,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {865#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {865#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:54,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {865#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {831#(<= 9 ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-28 14:58:54,159 INFO L280 TraceCheckUtils]: 12: Hoare triple {831#(<= 9 ULTIMATE.start_gcd_test_~b)} assume !(0 != gcd_test_~b); {826#false} is VALID [2020-07-28 14:58:54,159 INFO L280 TraceCheckUtils]: 13: Hoare triple {826#false} gcd_test_#res := gcd_test_~a; {826#false} is VALID [2020-07-28 14:58:54,160 INFO L280 TraceCheckUtils]: 14: Hoare triple {826#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {826#false} is VALID [2020-07-28 14:58:54,160 INFO L280 TraceCheckUtils]: 15: Hoare triple {826#false} assume 0 == __VERIFIER_assert_~cond; {826#false} is VALID [2020-07-28 14:58:54,160 INFO L280 TraceCheckUtils]: 16: Hoare triple {826#false} assume !false; {826#false} is VALID [2020-07-28 14:58:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:54,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:58:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-07-28 14:58:54,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487410257] [2020-07-28 14:58:54,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-28 14:58:54,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:54,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 14:58:54,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:54,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 14:58:54,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 14:58:54,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-07-28 14:58:54,199 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2020-07-28 14:58:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:54,368 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-07-28 14:58:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 14:58:54,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-28 14:58:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 14:58:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2020-07-28 14:58:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 14:58:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2020-07-28 14:58:54,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2020-07-28 14:58:54,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:54,436 INFO L225 Difference]: With dead ends: 46 [2020-07-28 14:58:54,436 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 14:58:54,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-07-28 14:58:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 14:58:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-28 14:58:54,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:54,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-28 14:58:54,454 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 14:58:54,455 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 14:58:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:54,456 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 14:58:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 14:58:54,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:54,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:54,457 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 14:58:54,457 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 14:58:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:54,458 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 14:58:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 14:58:54,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:54,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:54,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:54,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 14:58:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-28 14:58:54,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2020-07-28 14:58:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:54,461 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-28 14:58:54,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 14:58:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 14:58:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:58:54,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:54,462 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:54,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:54,673 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1239358850, now seen corresponding path program 4 times [2020-07-28 14:58:54,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:54,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603513272] [2020-07-28 14:58:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:54,688 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:58:54,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371323302] [2020-07-28 14:58:54,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:54,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-28 14:58:54,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:58:54,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-28 14:58:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:54,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:54,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {1042#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !(gcd_test_~a < 0); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !(gcd_test_~b < 0); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !(0 == gcd_test_~a); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !!(0 != gcd_test_~b); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !!(0 != gcd_test_~b); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,936 INFO L280 TraceCheckUtils]: 7: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !!(0 != gcd_test_~b); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,943 INFO L280 TraceCheckUtils]: 10: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !!(0 != gcd_test_~b); {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,944 INFO L280 TraceCheckUtils]: 11: Hoare triple {1047#(and (= 18 ULTIMATE.start_gcd_test_~b) (= 63 ULTIMATE.start_main_~x~0))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1081#(and (= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,945 INFO L280 TraceCheckUtils]: 12: Hoare triple {1081#(and (= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) (= 63 ULTIMATE.start_main_~x~0))} assume !!(0 != gcd_test_~b); {1081#(and (= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {1081#(and (= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) (= 63 ULTIMATE.start_main_~x~0))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1088#(and (= 63 ULTIMATE.start_main_~x~0) (= 18 (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a))))} is VALID [2020-07-28 14:58:54,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {1088#(and (= 63 ULTIMATE.start_main_~x~0) (= 18 (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a))))} assume !(0 != gcd_test_~b); {1092#(and (= (* 2 ULTIMATE.start_gcd_test_~a) 18) (= 63 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 14:58:54,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {1092#(and (= (* 2 ULTIMATE.start_gcd_test_~a) 18) (= 63 ULTIMATE.start_main_~x~0))} gcd_test_#res := gcd_test_~a; {1096#(and (= 63 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_gcd_test_#res| 9))} is VALID [2020-07-28 14:58:54,950 INFO L280 TraceCheckUtils]: 16: Hoare triple {1096#(and (= 63 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_gcd_test_#res| 9))} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1100#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:58:54,951 INFO L280 TraceCheckUtils]: 17: Hoare triple {1100#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1043#false} is VALID [2020-07-28 14:58:54,951 INFO L280 TraceCheckUtils]: 18: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2020-07-28 14:58:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-28 14:58:54,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603513272] [2020-07-28 14:58:54,953 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:58:54,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371323302] [2020-07-28 14:58:54,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:58:54,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-28 14:58:54,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511714148] [2020-07-28 14:58:54,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-28 14:58:54,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:54,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 14:58:54,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:54,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 14:58:54,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 14:58:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:58:54,984 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2020-07-28 14:58:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:55,471 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-28 14:58:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 14:58:55,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-28 14:58:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:58:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-28 14:58:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:58:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-28 14:58:55,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2020-07-28 14:58:55,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:55,546 INFO L225 Difference]: With dead ends: 46 [2020-07-28 14:58:55,547 INFO L226 Difference]: Without dead ends: 44 [2020-07-28 14:58:55,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-28 14:58:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-28 14:58:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-07-28 14:58:55,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:55,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 35 states. [2020-07-28 14:58:55,578 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 35 states. [2020-07-28 14:58:55,578 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 35 states. [2020-07-28 14:58:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:55,580 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-28 14:58:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-28 14:58:55,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:55,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:55,581 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 44 states. [2020-07-28 14:58:55,581 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 44 states. [2020-07-28 14:58:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:55,584 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-28 14:58:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-28 14:58:55,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:55,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:55,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:55,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 14:58:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-28 14:58:55,587 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2020-07-28 14:58:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:55,588 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-28 14:58:55,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 14:58:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-28 14:58:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:58:55,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:55,589 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:55,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:55,791 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1317757439, now seen corresponding path program 1 times [2020-07-28 14:58:55,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:55,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103304968] [2020-07-28 14:58:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:55,804 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:58:55,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53222106] [2020-07-28 14:58:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:55,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-28 14:58:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:55,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:56,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {1307#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume !(gcd_test_~a < 0); {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume !(gcd_test_~b < 0); {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,085 INFO L280 TraceCheckUtils]: 3: Hoare triple {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume !(0 == gcd_test_~a); {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,086 INFO L280 TraceCheckUtils]: 4: Hoare triple {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume !!(0 != gcd_test_~b); {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,086 INFO L280 TraceCheckUtils]: 5: Hoare triple {1312#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1328#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume !!(0 != gcd_test_~b); {1328#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {1328#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1335#(and (= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {1335#(and (= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume !!(0 != gcd_test_~b); {1335#(and (= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 14:58:56,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {1335#(and (= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:56,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:56,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:56,093 INFO L280 TraceCheckUtils]: 12: Hoare triple {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:56,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:56,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} assume !(0 != gcd_test_~b); {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:56,102 INFO L280 TraceCheckUtils]: 15: Hoare triple {1342#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a)))} gcd_test_#res := gcd_test_~a; {1361#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ |ULTIMATE.start_gcd_test_#res| (* 3 ULTIMATE.start_main_~y~0))))} is VALID [2020-07-28 14:58:56,104 INFO L280 TraceCheckUtils]: 16: Hoare triple {1361#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ |ULTIMATE.start_gcd_test_#res| (* 3 ULTIMATE.start_main_~y~0))))} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1365#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ ULTIMATE.start_main_~g~0 (* 3 ULTIMATE.start_main_~y~0))))} is VALID [2020-07-28 14:58:56,105 INFO L280 TraceCheckUtils]: 17: Hoare triple {1365#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ ULTIMATE.start_main_~g~0 (* 3 ULTIMATE.start_main_~y~0))))} assume !(0 == __VERIFIER_assert_~cond); {1365#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ ULTIMATE.start_main_~g~0 (* 3 ULTIMATE.start_main_~y~0))))} is VALID [2020-07-28 14:58:56,107 INFO L280 TraceCheckUtils]: 18: Hoare triple {1365#(and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ ULTIMATE.start_main_~g~0 (* 3 ULTIMATE.start_main_~y~0))))} __VERIFIER_assert_#in~cond := (if 0 == (if main_~y~0 < 0 && 0 != main_~y~0 % main_~g~0 then (if main_~g~0 < 0 then main_~y~0 % main_~g~0 + main_~g~0 else main_~y~0 % main_~g~0 - main_~g~0) else main_~y~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1372#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:58:56,108 INFO L280 TraceCheckUtils]: 19: Hoare triple {1372#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1308#false} is VALID [2020-07-28 14:58:56,108 INFO L280 TraceCheckUtils]: 20: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2020-07-28 14:58:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 14:58:56,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103304968] [2020-07-28 14:58:56,110 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:58:56,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53222106] [2020-07-28 14:58:56,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:58:56,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-28 14:58:56,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588619358] [2020-07-28 14:58:56,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 14:58:56,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:56,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 14:58:56,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:56,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 14:58:56,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 14:58:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-28 14:58:56,146 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 9 states. [2020-07-28 14:58:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:56,806 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2020-07-28 14:58:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 14:58:56,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 14:58:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 14:58:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-28 14:58:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 14:58:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-28 14:58:56,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2020-07-28 14:58:56,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:56,897 INFO L225 Difference]: With dead ends: 50 [2020-07-28 14:58:56,897 INFO L226 Difference]: Without dead ends: 39 [2020-07-28 14:58:56,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-28 14:58:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-28 14:58:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-28 14:58:56,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:56,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-28 14:58:56,927 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-28 14:58:56,927 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-28 14:58:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:56,929 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-28 14:58:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-28 14:58:56,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:56,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:56,930 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-28 14:58:56,930 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-28 14:58:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:56,932 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-28 14:58:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-28 14:58:56,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:56,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:56,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:56,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-28 14:58:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-28 14:58:56,934 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2020-07-28 14:58:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:56,934 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-28 14:58:56,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 14:58:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-28 14:58:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:58:56,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:56,935 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:57,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:57,147 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 300866041, now seen corresponding path program 5 times [2020-07-28 14:58:57,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:57,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382869347] [2020-07-28 14:58:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:57,166 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:58:57,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594212945] [2020-07-28 14:58:57,166 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:57,191 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-07-28 14:58:57,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:58:57,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 14:58:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:57,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:57,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {1578#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:57,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:57,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:57,745 INFO L280 TraceCheckUtils]: 3: Hoare triple {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:57,746 INFO L280 TraceCheckUtils]: 4: Hoare triple {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:58:57,747 INFO L280 TraceCheckUtils]: 5: Hoare triple {1583#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1599#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:57,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {1599#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {1599#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:57,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {1599#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1606#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:57,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {1606#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {1606#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:58:57,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {1606#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1613#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} is VALID [2020-07-28 14:58:57,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {1613#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} assume !!(0 != gcd_test_~b); {1613#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} is VALID [2020-07-28 14:58:57,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {1613#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1620#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} is VALID [2020-07-28 14:58:57,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {1620#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} assume !!(0 != gcd_test_~b); {1620#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} is VALID [2020-07-28 14:58:57,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {1620#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1627#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} is VALID [2020-07-28 14:58:57,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {1627#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} assume !!(0 != gcd_test_~b); {1627#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} is VALID [2020-07-28 14:58:57,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {1627#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1634#(exists ((ULTIMATE.start_gcd_test_~a Int)) (and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 3 ULTIMATE.start_gcd_test_~a)) 18)))} is VALID [2020-07-28 14:58:57,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {1634#(exists ((ULTIMATE.start_gcd_test_~a Int)) (and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 3 ULTIMATE.start_gcd_test_~a)) 18)))} assume !(0 != gcd_test_~b); {1579#false} is VALID [2020-07-28 14:58:57,763 INFO L280 TraceCheckUtils]: 17: Hoare triple {1579#false} gcd_test_#res := gcd_test_~a; {1579#false} is VALID [2020-07-28 14:58:57,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {1579#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1579#false} is VALID [2020-07-28 14:58:57,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {1579#false} assume 0 == __VERIFIER_assert_~cond; {1579#false} is VALID [2020-07-28 14:58:57,764 INFO L280 TraceCheckUtils]: 20: Hoare triple {1579#false} assume !false; {1579#false} is VALID [2020-07-28 14:58:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:58:57,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382869347] [2020-07-28 14:58:57,766 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:58:57,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594212945] [2020-07-28 14:58:57,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:58:57,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-28 14:58:57,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082958558] [2020-07-28 14:58:57,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 14:58:57,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:57,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 14:58:57,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 14:58:57,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 14:58:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-28 14:58:57,799 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 9 states. [2020-07-28 14:58:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:58,222 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-07-28 14:58:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 14:58:58,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 14:58:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 14:58:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-28 14:58:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 14:58:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-28 14:58:58,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-28 14:58:58,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:58,301 INFO L225 Difference]: With dead ends: 53 [2020-07-28 14:58:58,301 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 14:58:58,303 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-28 14:58:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 14:58:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-28 14:58:58,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:58,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-28 14:58:58,332 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-28 14:58:58,332 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-28 14:58:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:58,334 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-28 14:58:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-28 14:58:58,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:58,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:58,334 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-28 14:58:58,334 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-28 14:58:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:58,336 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-28 14:58:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-28 14:58:58,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:58,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:58,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:58,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-28 14:58:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-28 14:58:58,338 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2020-07-28 14:58:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:58,338 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-28 14:58:58,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 14:58:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-28 14:58:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:58:58,339 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:58,339 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:58,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:58,549 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash 243607739, now seen corresponding path program 6 times [2020-07-28 14:58:58,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:58,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549187790] [2020-07-28 14:58:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:58,561 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:58:58,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145808842] [2020-07-28 14:58:58,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:58,587 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-07-28 14:58:58,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:58:58,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 14:58:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:58,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:58:58,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {1835#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {1835#true} is VALID [2020-07-28 14:58:58,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {1835#true} assume !(gcd_test_~a < 0); {1835#true} is VALID [2020-07-28 14:58:58,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {1835#true} assume !(gcd_test_~b < 0); {1835#true} is VALID [2020-07-28 14:58:58,627 INFO L280 TraceCheckUtils]: 3: Hoare triple {1835#true} assume !(0 == gcd_test_~a); {1835#true} is VALID [2020-07-28 14:58:58,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {1835#true} assume !!(0 != gcd_test_~b); {1835#true} is VALID [2020-07-28 14:58:58,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {1835#true} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1835#true} is VALID [2020-07-28 14:58:58,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {1835#true} assume !!(0 != gcd_test_~b); {1835#true} is VALID [2020-07-28 14:58:58,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {1835#true} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1835#true} is VALID [2020-07-28 14:58:58,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {1835#true} assume !!(0 != gcd_test_~b); {1835#true} is VALID [2020-07-28 14:58:58,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {1835#true} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1835#true} is VALID [2020-07-28 14:58:58,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {1835#true} assume !!(0 != gcd_test_~b); {1835#true} is VALID [2020-07-28 14:58:58,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {1835#true} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1835#true} is VALID [2020-07-28 14:58:58,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {1835#true} assume !!(0 != gcd_test_~b); {1835#true} is VALID [2020-07-28 14:58:58,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {1835#true} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1835#true} is VALID [2020-07-28 14:58:58,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {1835#true} assume !!(0 != gcd_test_~b); {1882#(not (= 0 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:58,630 INFO L280 TraceCheckUtils]: 15: Hoare triple {1882#(not (= 0 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {1882#(not (= 0 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:58,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {1882#(not (= 0 ULTIMATE.start_gcd_test_~b))} assume !(0 != gcd_test_~b); {1836#false} is VALID [2020-07-28 14:58:58,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {1836#false} gcd_test_#res := gcd_test_~a; {1836#false} is VALID [2020-07-28 14:58:58,630 INFO L280 TraceCheckUtils]: 18: Hoare triple {1836#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1836#false} is VALID [2020-07-28 14:58:58,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {1836#false} assume 0 == __VERIFIER_assert_~cond; {1836#false} is VALID [2020-07-28 14:58:58,631 INFO L280 TraceCheckUtils]: 20: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2020-07-28 14:58:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-28 14:58:58,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549187790] [2020-07-28 14:58:58,631 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:58:58,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145808842] [2020-07-28 14:58:58,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:58:58,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 14:58:58,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410773406] [2020-07-28 14:58:58,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-28 14:58:58,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:58:58,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:58:58,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:58,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:58:58,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:58:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:58:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:58,650 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2020-07-28 14:58:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:58,729 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-28 14:58:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:58:58,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-28 14:58:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:58:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2020-07-28 14:58:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:58:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2020-07-28 14:58:58,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2020-07-28 14:58:58,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:58:58,774 INFO L225 Difference]: With dead ends: 47 [2020-07-28 14:58:58,774 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 14:58:58,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:58:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 14:58:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-28 14:58:58,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:58:58,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-28 14:58:58,815 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-28 14:58:58,815 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-28 14:58:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:58,816 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 14:58:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-28 14:58:58,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:58,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:58,817 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-28 14:58:58,817 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-28 14:58:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:58:58,818 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 14:58:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-28 14:58:58,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:58:58,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:58:58,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:58:58,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:58:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 14:58:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-28 14:58:58,820 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2020-07-28 14:58:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:58:58,820 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-28 14:58:58,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:58:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 14:58:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:58:58,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:58:58,821 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:58:59,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-28 14:58:59,022 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:58:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:58:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1110212667, now seen corresponding path program 7 times [2020-07-28 14:58:59,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:58:59,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742274483] [2020-07-28 14:58:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:58:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:59,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {2073#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {2075#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2076#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {2076#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {2076#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,158 INFO L280 TraceCheckUtils]: 7: Hoare triple {2076#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2077#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,159 INFO L280 TraceCheckUtils]: 8: Hoare triple {2077#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {2077#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:58:59,160 INFO L280 TraceCheckUtils]: 9: Hoare triple {2077#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2078#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-28 14:58:59,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {2078#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !!(0 != gcd_test_~b); {2078#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-28 14:58:59,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {2078#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2079#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-28 14:58:59,163 INFO L280 TraceCheckUtils]: 12: Hoare triple {2079#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} assume !!(0 != gcd_test_~b); {2079#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-28 14:58:59,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {2079#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2074#false} is VALID [2020-07-28 14:58:59,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {2074#false} assume !!(0 != gcd_test_~b); {2074#false} is VALID [2020-07-28 14:58:59,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {2074#false} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2074#false} is VALID [2020-07-28 14:58:59,164 INFO L280 TraceCheckUtils]: 16: Hoare triple {2074#false} assume !(0 != gcd_test_~b); {2074#false} is VALID [2020-07-28 14:58:59,164 INFO L280 TraceCheckUtils]: 17: Hoare triple {2074#false} gcd_test_#res := gcd_test_~a; {2074#false} is VALID [2020-07-28 14:58:59,164 INFO L280 TraceCheckUtils]: 18: Hoare triple {2074#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2074#false} is VALID [2020-07-28 14:58:59,164 INFO L280 TraceCheckUtils]: 19: Hoare triple {2074#false} assume 0 == __VERIFIER_assert_~cond; {2074#false} is VALID [2020-07-28 14:58:59,164 INFO L280 TraceCheckUtils]: 20: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2020-07-28 14:58:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:58:59,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742274483] [2020-07-28 14:58:59,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454554362] [2020-07-28 14:58:59,167 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 14:58:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:58:59,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 14:58:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:58:59,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:59:12,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {2073#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:59:12,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~a < 0); {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:59:12,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~b < 0); {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:59:12,097 INFO L280 TraceCheckUtils]: 3: Hoare triple {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(0 == gcd_test_~a); {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:59:12,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !!(0 != gcd_test_~b); {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-28 14:59:12,100 INFO L280 TraceCheckUtils]: 5: Hoare triple {2083#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2099#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:59:12,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {2099#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {2099#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:59:12,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {2099#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2106#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:59:12,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {2106#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {2106#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:59:12,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {2106#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2113#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:59:12,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {2113#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {2113#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-28 14:59:12,111 INFO L280 TraceCheckUtils]: 11: Hoare triple {2113#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2120#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:59:12,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {2120#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {2120#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:59:12,120 INFO L280 TraceCheckUtils]: 13: Hoare triple {2120#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2074#false} is VALID [2020-07-28 14:59:12,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {2074#false} assume !!(0 != gcd_test_~b); {2074#false} is VALID [2020-07-28 14:59:12,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {2074#false} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2074#false} is VALID [2020-07-28 14:59:12,121 INFO L280 TraceCheckUtils]: 16: Hoare triple {2074#false} assume !(0 != gcd_test_~b); {2074#false} is VALID [2020-07-28 14:59:12,121 INFO L280 TraceCheckUtils]: 17: Hoare triple {2074#false} gcd_test_#res := gcd_test_~a; {2074#false} is VALID [2020-07-28 14:59:12,121 INFO L280 TraceCheckUtils]: 18: Hoare triple {2074#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2074#false} is VALID [2020-07-28 14:59:12,121 INFO L280 TraceCheckUtils]: 19: Hoare triple {2074#false} assume 0 == __VERIFIER_assert_~cond; {2074#false} is VALID [2020-07-28 14:59:12,122 INFO L280 TraceCheckUtils]: 20: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2020-07-28 14:59:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:59:12,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:59:12,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-07-28 14:59:12,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924326838] [2020-07-28 14:59:12,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-28 14:59:12,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:59:12,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 14:59:12,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:59:12,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 14:59:12,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:59:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 14:59:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-28 14:59:12,194 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 12 states. [2020-07-28 14:59:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:59:12,686 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-28 14:59:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 14:59:12,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-28 14:59:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:59:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 14:59:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-28 14:59:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 14:59:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-28 14:59:12,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-28 14:59:12,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:59:12,781 INFO L225 Difference]: With dead ends: 48 [2020-07-28 14:59:12,781 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 14:59:12,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-28 14:59:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 14:59:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-28 14:59:12,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:59:12,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-28 14:59:12,815 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-28 14:59:12,815 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-28 14:59:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:59:12,816 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-28 14:59:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-28 14:59:12,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:59:12,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:59:12,816 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-28 14:59:12,817 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-28 14:59:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:59:12,817 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-28 14:59:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-28 14:59:12,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:59:12,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:59:12,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:59:12,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:59:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 14:59:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-28 14:59:12,820 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2020-07-28 14:59:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:59:12,821 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-28 14:59:12,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 14:59:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-28 14:59:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 14:59:12,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:59:12,821 INFO L422 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:59:13,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-28 14:59:13,025 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:59:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:59:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash -497384202, now seen corresponding path program 8 times [2020-07-28 14:59:13,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:59:13,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929575178] [2020-07-28 14:59:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:59:13,043 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:59:13,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437767989] [2020-07-28 14:59:13,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:59:13,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:59:13,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:59:13,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 14:59:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:59:13,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:59:15,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {2320#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:59:15,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:59:15,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:59:15,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:59:15,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-28 14:59:15,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {2325#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2341#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:59:15,320 INFO L280 TraceCheckUtils]: 6: Hoare triple {2341#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {2341#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:59:15,321 INFO L280 TraceCheckUtils]: 7: Hoare triple {2341#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2348#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:59:15,322 INFO L280 TraceCheckUtils]: 8: Hoare triple {2348#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {2348#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-28 14:59:15,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {2348#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2355#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} is VALID [2020-07-28 14:59:15,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {2355#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} assume !!(0 != gcd_test_~b); {2355#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} is VALID [2020-07-28 14:59:15,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {2355#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (<= ULTIMATE.start_gcd_test_~b 18))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2362#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} is VALID [2020-07-28 14:59:15,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {2362#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} assume !!(0 != gcd_test_~b); {2362#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} is VALID [2020-07-28 14:59:15,330 INFO L280 TraceCheckUtils]: 13: Hoare triple {2362#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2369#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} is VALID [2020-07-28 14:59:15,331 INFO L280 TraceCheckUtils]: 14: Hoare triple {2369#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} assume !!(0 != gcd_test_~b); {2369#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} is VALID [2020-07-28 14:59:15,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {2369#(and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {2376#(exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 2 v_ULTIMATE.start_gcd_test_~a_31)) 18) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18) (<= v_ULTIMATE.start_gcd_test_~a_31 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))))} is VALID [2020-07-28 14:59:15,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {2376#(exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 2 v_ULTIMATE.start_gcd_test_~a_31)) 18) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18) (<= v_ULTIMATE.start_gcd_test_~a_31 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))))} assume !!(0 != gcd_test_~b); {2376#(exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 2 v_ULTIMATE.start_gcd_test_~a_31)) 18) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18) (<= v_ULTIMATE.start_gcd_test_~a_31 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))))} is VALID [2020-07-28 14:59:15,345 INFO L280 TraceCheckUtils]: 17: Hoare triple {2376#(exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 2 v_ULTIMATE.start_gcd_test_~a_31)) 18) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18) (<= v_ULTIMATE.start_gcd_test_~a_31 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {2383#(exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 5 v_ULTIMATE.start_gcd_test_~a_31)) 36) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18)))} is VALID [2020-07-28 14:59:15,348 INFO L280 TraceCheckUtils]: 18: Hoare triple {2383#(exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 5 v_ULTIMATE.start_gcd_test_~a_31)) 36) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18)))} assume !(0 != gcd_test_~b); {2321#false} is VALID [2020-07-28 14:59:15,348 INFO L280 TraceCheckUtils]: 19: Hoare triple {2321#false} gcd_test_#res := gcd_test_~a; {2321#false} is VALID [2020-07-28 14:59:15,349 INFO L280 TraceCheckUtils]: 20: Hoare triple {2321#false} main_#t~ret0 := gcd_test_#res;assume -2147483648 <= main_#t~ret0 && main_#t~ret0 <= 2147483647;main_~g~0 := main_#t~ret0;havoc main_#t~ret0;__VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 < 0 && 0 != main_~x~0 % main_~g~0 then (if main_~g~0 < 0 then main_~x~0 % main_~g~0 + main_~g~0 else main_~x~0 % main_~g~0 - main_~g~0) else main_~x~0 % main_~g~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2321#false} is VALID [2020-07-28 14:59:15,349 INFO L280 TraceCheckUtils]: 21: Hoare triple {2321#false} assume 0 == __VERIFIER_assert_~cond; {2321#false} is VALID [2020-07-28 14:59:15,349 INFO L280 TraceCheckUtils]: 22: Hoare triple {2321#false} assume !false; {2321#false} is VALID [2020-07-28 14:59:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:59:15,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929575178] [2020-07-28 14:59:15,351 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:59:15,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437767989] [2020-07-28 14:59:15,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:59:15,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-28 14:59:15,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335648999] [2020-07-28 14:59:15,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-07-28 14:59:15,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:59:15,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:59:15,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:59:15,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:59:15,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:59:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:59:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=70, Unknown=2, NotChecked=0, Total=90 [2020-07-28 14:59:15,399 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2020-07-28 14:59:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:59:16,166 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-28 14:59:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 14:59:16,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-07-28 14:59:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:59:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:59:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-28 14:59:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:59:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-28 14:59:16,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-28 14:59:16,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:59:16,216 INFO L225 Difference]: With dead ends: 32 [2020-07-28 14:59:16,216 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 14:59:16,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=139, Unknown=2, NotChecked=0, Total=182 [2020-07-28 14:59:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 14:59:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 14:59:16,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:59:16,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 14:59:16,218 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 14:59:16,218 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 14:59:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:59:16,218 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 14:59:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 14:59:16,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:59:16,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:59:16,219 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 14:59:16,219 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 14:59:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:59:16,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 14:59:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 14:59:16,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:59:16,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:59:16,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:59:16,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:59:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 14:59:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 14:59:16,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-28 14:59:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:59:16,220 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 14:59:16,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:59:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 14:59:16,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:59:16,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:59:16,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 14:59:16,925 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-28 14:59:16,961 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 14:59:16,961 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2020-07-28 14:59:16,961 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 14:59:16,962 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 14:59:16,962 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 14:59:16,962 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-28 14:59:16,962 INFO L264 CegarLoopResult]: At program point L20-2(lines 19 25) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) (.cse4 (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0)) (.cse3 (= 18 ULTIMATE.start_gcd_test_~b)) (.cse1 (= 63 ULTIMATE.start_main_~x~0)) (.cse2 (= 63 (+ (* ULTIMATE.start_main_~y~0 3) ULTIMATE.start_gcd_test_~a)))) (or (and (<= (div (+ ULTIMATE.start_gcd_test_~a (- 63)) (- 3)) 18) (<= .cse0 18) .cse1 (<= 9 ULTIMATE.start_gcd_test_~b) .cse2) (and .cse3 .cse4 .cse1 (= 63 .cse0)) (and .cse1 (<= (+ ULTIMATE.start_gcd_test_~b (* 2 ULTIMATE.start_gcd_test_~a)) 18) .cse2 (exists ((v_ULTIMATE.start_gcd_test_~a_31 Int)) (and (<= (+ ULTIMATE.start_gcd_test_~b (* 2 v_ULTIMATE.start_gcd_test_~a_31)) 18) (<= (div (+ v_ULTIMATE.start_gcd_test_~a_31 (- 63)) (- 3)) 18) (<= v_ULTIMATE.start_gcd_test_~a_31 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))))) (and (= 63 ULTIMATE.start_gcd_test_~a) .cse3 .cse4 .cse1) (let ((.cse5 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a))) (and (<= .cse5 63) .cse3 .cse4 .cse1 (<= 63 .cse5))) (and (= 18 ULTIMATE.start_main_~y~0) .cse3 .cse1 .cse2))) [2020-07-28 14:59:16,962 INFO L271 CegarLoopResult]: At program point L45(lines 30 46) the Hoare annotation is: true [2020-07-28 14:59:16,962 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-28 14:59:16,962 INFO L268 CegarLoopResult]: For program point L12-2(lines 11 27) no Hoare annotation was computed. [2020-07-28 14:59:16,962 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 14:59:16,963 INFO L268 CegarLoopResult]: For program point L13-1(lines 11 27) no Hoare annotation was computed. [2020-07-28 14:59:16,963 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-28 14:59:16,963 INFO L264 CegarLoopResult]: At program point L5-2(lines 4 9) the Hoare annotation is: (let ((.cse0 (* 3 ULTIMATE.start_main_~y~0))) (and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ ULTIMATE.start_main_~g~0 .cse0)) (= 63 (+ |ULTIMATE.start_gcd_test_#res| .cse0)) (= 63 (+ .cse0 ULTIMATE.start_gcd_test_~a)))) [2020-07-28 14:59:16,963 INFO L268 CegarLoopResult]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2020-07-28 14:59:16,963 INFO L264 CegarLoopResult]: At program point L5-5(lines 4 9) the Hoare annotation is: (let ((.cse0 (* 3 ULTIMATE.start_main_~y~0))) (and (= 18 ULTIMATE.start_main_~y~0) (= 63 (+ ULTIMATE.start_main_~g~0 .cse0)) (= 63 (+ |ULTIMATE.start_gcd_test_#res| .cse0)) (= 63 (+ .cse0 ULTIMATE.start_gcd_test_~a)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond))) [2020-07-28 14:59:16,963 INFO L268 CegarLoopResult]: For program point L5-6(lines 5 7) no Hoare annotation was computed. [2020-07-28 14:59:16,963 INFO L271 CegarLoopResult]: At program point L5-8(lines 4 9) the Hoare annotation is: true [2020-07-28 14:59:16,963 INFO L264 CegarLoopResult]: At program point L26(lines 10 27) the Hoare annotation is: (let ((.cse0 (* ULTIMATE.start_main_~y~0 3))) (and (= 63 (+ |ULTIMATE.start_gcd_test_#res| .cse0)) (= 63 ULTIMATE.start_main_~x~0) (= 18 (+ ULTIMATE.start_gcd_test_~b (* ULTIMATE.start_gcd_test_~a 2))) (= 63 (+ .cse0 ULTIMATE.start_gcd_test_~a)) (= |ULTIMATE.start_gcd_test_#res| 9))) [2020-07-28 14:59:16,964 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 14:59:16,964 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-28 14:59:16,964 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-28 14:59:16,964 INFO L268 CegarLoopResult]: For program point L6-2(line 6) no Hoare annotation was computed. [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 14:59:16,968 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-28 14:59:16,969 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L5-6 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L5-6 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L5-6 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:59:16,970 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:59:16,970 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 14:59:16,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:16,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:16,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:16,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:16,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:16,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:16,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:59:16 BoogieIcfgContainer [2020-07-28 14:59:16,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:59:16,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:59:16,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:59:16,992 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:59:16,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:58:50" (3/4) ... [2020-07-28 14:59:16,996 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 14:59:17,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 14:59:17,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 14:59:17,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a + -63) / -3 <= 18 && b + a <= 18) && 63 == x) && 9 <= b) && 63 == y * 3 + a) || (((18 == b && b == y) && 63 == x) && 63 == b + a)) || (((63 == x && b + 2 * a <= 18) && 63 == y * 3 + a) && (\exists v_ULTIMATE.start_gcd_test_~a_31 : int :: (b + 2 * v_ULTIMATE.start_gcd_test_~a_31 <= 18 && (v_ULTIMATE.start_gcd_test_~a_31 + -63) / -3 <= 18) && v_ULTIMATE.start_gcd_test_~a_31 <= b + a))) || (((63 == a && 18 == b) && b == y) && 63 == x)) || ((((2 * b + a <= 63 && 18 == b) && b == y) && 63 == x) && 63 <= 2 * b + a)) || (((18 == y && 18 == b) && 63 == x) && 63 == y * 3 + a) [2020-07-28 14:59:17,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((63 == \result + y * 3 && 63 == x) && 18 == b + a * 2) && 63 == y * 3 + a) && \result == 9 [2020-07-28 14:59:17,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((18 == y && 63 == g + 3 * y) && 63 == \result + 3 * y) && 63 == 3 * y + a [2020-07-28 14:59:17,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((18 == y && 63 == g + 3 * y) && 63 == \result + 3 * y) && 63 == 3 * y + a) && 1 <= cond [2020-07-28 14:59:17,073 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:59:17,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:59:17,075 INFO L168 Benchmark]: Toolchain (without parser) took 27597.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. [2020-07-28 14:59:17,075 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:59:17,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.38 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:59:17,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.64 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:59:17,078 INFO L168 Benchmark]: Boogie Preprocessor took 85.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-28 14:59:17,078 INFO L168 Benchmark]: RCFGBuilder took 359.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2020-07-28 14:59:17,079 INFO L168 Benchmark]: TraceAbstraction took 26796.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.6 MB). Peak memory consumption was 151.5 MB. Max. memory is 11.5 GB. [2020-07-28 14:59:17,079 INFO L168 Benchmark]: Witness Printer took 81.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:59:17,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.38 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.64 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26796.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.6 MB). Peak memory consumption was 151.5 MB. Max. memory is 11.5 GB. * Witness Printer took 81.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (((63 == \result + y * 3 && 63 == x) && 18 == b + a * 2) && 63 == y * 3 + a) && \result == 9 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: (((18 == y && 63 == g + 3 * y) && 63 == \result + 3 * y) && 63 == 3 * y + a) && 1 <= cond - InvariantResult [Line: 19]: Loop Invariant [2020-07-28 14:59:17,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:17,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:17,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:17,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:17,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] [2020-07-28 14:59:17,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_gcd_test_~a_31,QUANTIFIED] Derived loop invariant: (((((((((a + -63) / -3 <= 18 && b + a <= 18) && 63 == x) && 9 <= b) && 63 == y * 3 + a) || (((18 == b && b == y) && 63 == x) && 63 == b + a)) || (((63 == x && b + 2 * a <= 18) && 63 == y * 3 + a) && (\exists v_ULTIMATE.start_gcd_test_~a_31 : int :: (b + 2 * v_ULTIMATE.start_gcd_test_~a_31 <= 18 && (v_ULTIMATE.start_gcd_test_~a_31 + -63) / -3 <= 18) && v_ULTIMATE.start_gcd_test_~a_31 <= b + a))) || (((63 == a && 18 == b) && b == y) && 63 == x)) || ((((2 * b + a <= 63 && 18 == b) && b == y) && 63 == x) && 63 <= 2 * b + a)) || (((18 == y && 18 == b) && 63 == x) && 63 == y * 3 + a) - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: ((18 == y && 63 == g + 3 * y) && 63 == \result + 3 * y) && 63 == 3 * y + a - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.1s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 162 SDtfs, 114 SDslu, 392 SDs, 0 SdLazy, 557 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 19 NumberOfFragments, 218 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 236 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 222 ConstructedInterpolants, 4 QuantifiedInterpolants, 25854 SizeOfPredicates, 54 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 125/289 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...