/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:13,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:13,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:14,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:14,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:14,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:14,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:14,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:14,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:14,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:14,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:14,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:14,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:14,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:14,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:14,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:14,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:14,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:14,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:14,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:14,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:14,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:14,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:14,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:14,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:14,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:14,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:14,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:14,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:14,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:14,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:14,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:14,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:14,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:14,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:14,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:14,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:14,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:14,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:14,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:14,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:14,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:29:14,093 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:14,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:14,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:14,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:14,096 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:14,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:14,096 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:14,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:14,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:14,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:14,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:14,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:14,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:14,098 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:14,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:14,098 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:14,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:14,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:14,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:14,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:14,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:14,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:14,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:14,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:14,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:14,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:14,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:14,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:14,101 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:14,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:14,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:14,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:14,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:14,450 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:14,451 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:14,452 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-10 15:29:14,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14726318/0af74ec3a1a14b1c8d249780d7bee8cb/FLAG864750fda [2020-07-10 15:29:15,149 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:15,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-10 15:29:15,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14726318/0af74ec3a1a14b1c8d249780d7bee8cb/FLAG864750fda [2020-07-10 15:29:15,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14726318/0af74ec3a1a14b1c8d249780d7bee8cb [2020-07-10 15:29:15,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:15,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:15,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:15,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:15,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:15,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7494450f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15, skipping insertion in model container [2020-07-10 15:29:15,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:15,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:15,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:15,823 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:15,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:15,855 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:15,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15 WrapperNode [2020-07-10 15:29:15,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:15,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:15,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:15,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:15,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:15,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:15,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:15,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:16,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (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-10 15:29:16,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:16,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:16,478 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:16,479 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:16,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:16 BoogieIcfgContainer [2020-07-10 15:29:16,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:16,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:16,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:16,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:16,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:15" (1/3) ... [2020-07-10 15:29:16,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e380f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:16, skipping insertion in model container [2020-07-10 15:29:16,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (2/3) ... [2020-07-10 15:29:16,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e380f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:16, skipping insertion in model container [2020-07-10 15:29:16,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:16" (3/3) ... [2020-07-10 15:29:16,494 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2020-07-10 15:29:16,506 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:16,514 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:16,529 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:16,561 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:16,562 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:16,562 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:16,563 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:16,563 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:16,563 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:16,563 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:16,563 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 15:29:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:29:16,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:16,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:16,600 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 508025261, now seen corresponding path program 1 times [2020-07-10 15:29:16,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:16,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545936430] [2020-07-10 15:29:16,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:16,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:29:16,892 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #48#return; {24#true} is VALID [2020-07-10 15:29:16,894 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 15:29:16,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:29:16,895 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #48#return; {24#true} is VALID [2020-07-10 15:29:16,895 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2020-07-10 15:29:16,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {28#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:16,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {28#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:16,903 INFO L263 TraceCheckUtils]: 6: Hoare triple {28#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {29#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:16,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {30#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:16,906 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {25#false} is VALID [2020-07-10 15:29:16,907 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 15:29:16,909 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-10 15:29:16,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545936430] [2020-07-10 15:29:16,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:16,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:29:16,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829412581] [2020-07-10 15:29:16,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:29:16,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:16,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:29:16,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:16,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:29:16,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:29:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:29:16,992 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-10 15:29:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:17,282 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2020-07-10 15:29:17,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:29:17,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:29:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-07-10 15:29:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-07-10 15:29:17,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2020-07-10 15:29:17,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:17,518 INFO L225 Difference]: With dead ends: 46 [2020-07-10 15:29:17,521 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:29:17,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10 15:29:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:29:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-10 15:29:17,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:17,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2020-07-10 15:29:17,620 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2020-07-10 15:29:17,620 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2020-07-10 15:29:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:17,634 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-10 15:29:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 15:29:17,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:17,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:17,638 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2020-07-10 15:29:17,638 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2020-07-10 15:29:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:17,648 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-10 15:29:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 15:29:17,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:17,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:17,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:17,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:29:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 15:29:17,664 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2020-07-10 15:29:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:17,665 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 15:29:17,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:29:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:29:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:17,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:17,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:17,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:17,673 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash -133512762, now seen corresponding path program 1 times [2020-07-10 15:29:17,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:17,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387881303] [2020-07-10 15:29:17,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {181#true} assume true; {181#true} is VALID [2020-07-10 15:29:17,874 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {181#true} {181#true} #48#return; {181#true} is VALID [2020-07-10 15:29:17,874 INFO L263 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2020-07-10 15:29:17,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2020-07-10 15:29:17,875 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #48#return; {181#true} is VALID [2020-07-10 15:29:17,876 INFO L263 TraceCheckUtils]: 3: Hoare triple {181#true} call #t~ret2 := main(); {181#true} is VALID [2020-07-10 15:29:17,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {181#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {185#(<= 0 main_~x~0)} is VALID [2020-07-10 15:29:17,881 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {185#(<= 0 main_~x~0)} is VALID [2020-07-10 15:29:17,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#(<= 0 main_~x~0)} assume 0 != #t~nondet1;havoc #t~nondet1;~m~0 := ~x~0; {186#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:17,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {186#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {186#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:17,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {186#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:17,909 INFO L263 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {187#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:17,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {187#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {188#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:17,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {188#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {182#false} is VALID [2020-07-10 15:29:17,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {182#false} assume !false; {182#false} is VALID [2020-07-10 15:29:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:17,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387881303] [2020-07-10 15:29:17,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91318528] [2020-07-10 15:29:17,920 INFO L94 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-10 15:29:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:29:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:18,102 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:18,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2020-07-10 15:29:18,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2020-07-10 15:29:18,164 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #48#return; {181#true} is VALID [2020-07-10 15:29:18,165 INFO L263 TraceCheckUtils]: 3: Hoare triple {181#true} call #t~ret2 := main(); {181#true} is VALID [2020-07-10 15:29:18,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {181#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {185#(<= 0 main_~x~0)} is VALID [2020-07-10 15:29:18,167 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {185#(<= 0 main_~x~0)} is VALID [2020-07-10 15:29:18,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#(<= 0 main_~x~0)} assume 0 != #t~nondet1;havoc #t~nondet1;~m~0 := ~x~0; {186#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:18,171 INFO L280 TraceCheckUtils]: 7: Hoare triple {186#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {186#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:18,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {186#(<= 0 main_~m~0)} is VALID [2020-07-10 15:29:18,175 INFO L263 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {219#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:18,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {219#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {223#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:18,178 INFO L280 TraceCheckUtils]: 11: Hoare triple {223#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {182#false} is VALID [2020-07-10 15:29:18,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {182#false} assume !false; {182#false} is VALID [2020-07-10 15:29:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:18,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:18,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 15:29:18,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084501460] [2020-07-10 15:29:18,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-10 15:29:18,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:18,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:29:18,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:18,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:29:18,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:29:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:18,210 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 8 states. [2020-07-10 15:29:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:18,464 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:29:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:29:18,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-10 15:29:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-07-10 15:29:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-07-10 15:29:18,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2020-07-10 15:29:18,523 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-10 15:29:18,526 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:29:18,527 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:29:18,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:29:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-07-10 15:29:18,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:18,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 18 states. [2020-07-10 15:29:18,557 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 18 states. [2020-07-10 15:29:18,558 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 18 states. [2020-07-10 15:29:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:18,562 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:29:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:29:18,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:18,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:18,569 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 26 states. [2020-07-10 15:29:18,569 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 26 states. [2020-07-10 15:29:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:18,582 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:29:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:29:18,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:18,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:18,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:18,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:29:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 15:29:18,589 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-10 15:29:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:18,590 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 15:29:18,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:29:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:29:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:29:18,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:18,593 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:18,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:18,807 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1022031800, now seen corresponding path program 1 times [2020-07-10 15:29:18,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:18,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085924171] [2020-07-10 15:29:18,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:18,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {354#true} assume true; {354#true} is VALID [2020-07-10 15:29:18,959 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {354#true} {354#true} #48#return; {354#true} is VALID [2020-07-10 15:29:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:18,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2020-07-10 15:29:18,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2020-07-10 15:29:18,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2020-07-10 15:29:18,991 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {354#true} {359#(<= main_~n~0 0)} #52#return; {359#(<= main_~n~0 0)} is VALID [2020-07-10 15:29:18,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2020-07-10 15:29:18,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {354#true} assume true; {354#true} is VALID [2020-07-10 15:29:18,992 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {354#true} {354#true} #48#return; {354#true} is VALID [2020-07-10 15:29:18,993 INFO L263 TraceCheckUtils]: 3: Hoare triple {354#true} call #t~ret2 := main(); {354#true} is VALID [2020-07-10 15:29:18,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {354#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {358#(<= main_~x~0 0)} is VALID [2020-07-10 15:29:18,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {358#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {359#(<= main_~n~0 0)} is VALID [2020-07-10 15:29:19,000 INFO L263 TraceCheckUtils]: 6: Hoare triple {359#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {354#true} is VALID [2020-07-10 15:29:19,000 INFO L280 TraceCheckUtils]: 7: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2020-07-10 15:29:19,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2020-07-10 15:29:19,001 INFO L280 TraceCheckUtils]: 9: Hoare triple {354#true} assume true; {354#true} is VALID [2020-07-10 15:29:19,002 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {354#true} {359#(<= main_~n~0 0)} #52#return; {359#(<= main_~n~0 0)} is VALID [2020-07-10 15:29:19,004 INFO L263 TraceCheckUtils]: 11: Hoare triple {359#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:19,005 INFO L280 TraceCheckUtils]: 12: Hoare triple {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {365#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:19,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {365#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {355#false} is VALID [2020-07-10 15:29:19,006 INFO L280 TraceCheckUtils]: 14: Hoare triple {355#false} assume !false; {355#false} is VALID [2020-07-10 15:29:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:19,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085924171] [2020-07-10 15:29:19,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:19,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:29:19,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996992318] [2020-07-10 15:29:19,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-10 15:29:19,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:19,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:19,032 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-10 15:29:19,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:19,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:19,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:19,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:19,038 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-07-10 15:29:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,313 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:29:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:19,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-10 15:29:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-10 15:29:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-10 15:29:19,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2020-07-10 15:29:19,367 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-10 15:29:19,368 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:29:19,369 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:29:19,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:29:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-10 15:29:19,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:19,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2020-07-10 15:29:19,396 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2020-07-10 15:29:19,397 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2020-07-10 15:29:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,399 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-10 15:29:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 15:29:19,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,401 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2020-07-10 15:29:19,401 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2020-07-10 15:29:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,404 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-10 15:29:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 15:29:19,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:19,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:29:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-10 15:29:19,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2020-07-10 15:29:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:19,409 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-10 15:29:19,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 15:29:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:29:19,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:19,410 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:19,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:29:19,411 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash 996292415, now seen corresponding path program 1 times [2020-07-10 15:29:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:19,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420267507] [2020-07-10 15:29:19,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:19,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:29:19,539 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {488#true} {488#true} #48#return; {488#true} is VALID [2020-07-10 15:29:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:19,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-10 15:29:19,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-10 15:29:19,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:29:19,552 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {493#(<= (+ main_~m~0 1) main_~n~0)} #52#return; {493#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:19,553 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {488#true} is VALID [2020-07-10 15:29:19,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:29:19,554 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} #48#return; {488#true} is VALID [2020-07-10 15:29:19,554 INFO L263 TraceCheckUtils]: 3: Hoare triple {488#true} call #t~ret2 := main(); {488#true} is VALID [2020-07-10 15:29:19,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {488#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {488#true} is VALID [2020-07-10 15:29:19,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {492#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-10 15:29:19,558 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#(<= (+ main_~x~0 1) main_~n~0)} assume 0 != #t~nondet1;havoc #t~nondet1;~m~0 := ~x~0; {493#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:19,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {493#(<= (+ main_~m~0 1) main_~n~0)} ~x~0 := 1 + ~x~0; {493#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:19,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {493#(<= (+ main_~m~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {493#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:19,560 INFO L263 TraceCheckUtils]: 9: Hoare triple {493#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {488#true} is VALID [2020-07-10 15:29:19,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-10 15:29:19,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-10 15:29:19,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:29:19,564 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {488#true} {493#(<= (+ main_~m~0 1) main_~n~0)} #52#return; {493#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:19,566 INFO L263 TraceCheckUtils]: 14: Hoare triple {493#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {498#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:19,568 INFO L280 TraceCheckUtils]: 15: Hoare triple {498#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {499#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:19,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {499#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {489#false} is VALID [2020-07-10 15:29:19,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-10 15:29:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:19,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420267507] [2020-07-10 15:29:19,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:19,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:29:19,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061878688] [2020-07-10 15:29:19,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 15:29:19,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:19,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:19,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:19,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:19,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:19,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:19,614 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2020-07-10 15:29:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,837 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:29:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:29:19,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 15:29:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 15:29:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 15:29:19,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-10 15:29:19,882 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-10 15:29:19,884 INFO L225 Difference]: With dead ends: 28 [2020-07-10 15:29:19,884 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 15:29:19,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 15:29:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 15:29:19,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:19,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:19,903 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:19,903 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,905 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:29:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-10 15:29:19,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,906 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:19,906 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,908 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:29:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-10 15:29:19,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:19,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:29:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-10 15:29:19,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2020-07-10 15:29:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:19,912 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-10 15:29:19,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-10 15:29:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:29:19,913 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:19,914 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:19,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:29:19,914 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1254457853, now seen corresponding path program 1 times [2020-07-10 15:29:19,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:19,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4237436] [2020-07-10 15:29:19,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 15:29:20,069 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {615#true} {615#true} #48#return; {615#true} is VALID [2020-07-10 15:29:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~cond := #in~cond; {615#true} is VALID [2020-07-10 15:29:20,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume !(0 == ~cond); {615#true} is VALID [2020-07-10 15:29:20,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 15:29:20,081 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {615#true} {620#(<= (+ main_~m~0 1) main_~n~0)} #52#return; {620#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:20,081 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-10 15:29:20,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 15:29:20,082 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #48#return; {615#true} is VALID [2020-07-10 15:29:20,083 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret2 := main(); {615#true} is VALID [2020-07-10 15:29:20,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {619#(<= main_~m~0 main_~x~0)} is VALID [2020-07-10 15:29:20,086 INFO L280 TraceCheckUtils]: 5: Hoare triple {619#(<= main_~m~0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {620#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:20,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {620#(<= (+ main_~m~0 1) main_~n~0)} assume !(0 != #t~nondet1);havoc #t~nondet1; {620#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:20,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {620#(<= (+ main_~m~0 1) main_~n~0)} ~x~0 := 1 + ~x~0; {620#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:20,090 INFO L280 TraceCheckUtils]: 8: Hoare triple {620#(<= (+ main_~m~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {620#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:20,090 INFO L263 TraceCheckUtils]: 9: Hoare triple {620#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {615#true} is VALID [2020-07-10 15:29:20,091 INFO L280 TraceCheckUtils]: 10: Hoare triple {615#true} ~cond := #in~cond; {615#true} is VALID [2020-07-10 15:29:20,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {615#true} assume !(0 == ~cond); {615#true} is VALID [2020-07-10 15:29:20,091 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 15:29:20,092 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {615#true} {620#(<= (+ main_~m~0 1) main_~n~0)} #52#return; {620#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-10 15:29:20,094 INFO L263 TraceCheckUtils]: 14: Hoare triple {620#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {625#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:20,096 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {626#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:20,098 INFO L280 TraceCheckUtils]: 16: Hoare triple {626#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {616#false} is VALID [2020-07-10 15:29:20,098 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-10 15:29:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:20,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4237436] [2020-07-10 15:29:20,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005251418] [2020-07-10 15:29:20,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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) [2020-07-10 15:29:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:20,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:29:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:20,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:20,263 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:20,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-10 15:29:20,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 15:29:20,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #48#return; {615#true} is VALID [2020-07-10 15:29:20,314 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret2 := main(); {615#true} is VALID [2020-07-10 15:29:20,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {642#(and (<= 0 main_~x~0) (<= main_~m~0 0))} is VALID [2020-07-10 15:29:20,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {642#(and (<= 0 main_~x~0) (<= main_~m~0 0))} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} is VALID [2020-07-10 15:29:20,318 INFO L280 TraceCheckUtils]: 6: Hoare triple {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} assume !(0 != #t~nondet1);havoc #t~nondet1; {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} is VALID [2020-07-10 15:29:20,319 INFO L280 TraceCheckUtils]: 7: Hoare triple {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} ~x~0 := 1 + ~x~0; {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} is VALID [2020-07-10 15:29:20,320 INFO L280 TraceCheckUtils]: 8: Hoare triple {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} assume !(~x~0 < ~n~0); {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} is VALID [2020-07-10 15:29:20,320 INFO L263 TraceCheckUtils]: 9: Hoare triple {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {615#true} is VALID [2020-07-10 15:29:20,320 INFO L280 TraceCheckUtils]: 10: Hoare triple {615#true} ~cond := #in~cond; {615#true} is VALID [2020-07-10 15:29:20,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {615#true} assume !(0 == ~cond); {615#true} is VALID [2020-07-10 15:29:20,321 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 15:29:20,323 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {615#true} {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} #52#return; {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} is VALID [2020-07-10 15:29:20,330 INFO L263 TraceCheckUtils]: 14: Hoare triple {646#(and (<= 1 main_~n~0) (<= main_~m~0 0))} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:20,332 INFO L280 TraceCheckUtils]: 15: Hoare triple {674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:20,333 INFO L280 TraceCheckUtils]: 16: Hoare triple {678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {616#false} is VALID [2020-07-10 15:29:20,333 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-10 15:29:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:20,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:20,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-07-10 15:29:20,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123216008] [2020-07-10 15:29:20,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-10 15:29:20,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:20,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:29:20,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:20,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:29:20,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:29:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:20,380 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2020-07-10 15:29:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:20,568 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:29:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:20,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-10 15:29:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-10 15:29:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-10 15:29:20,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2020-07-10 15:29:20,605 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-10 15:29:20,605 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:29:20,606 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:20,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:29:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:20,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:20,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:20,608 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:20,608 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:20,608 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:20,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:20,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:20,609 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:20,609 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:20,609 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:20,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:20,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:20,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:20,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:20,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-10 15:29:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:20,611 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:20,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:29:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:20,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:20,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:20,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:21,094 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:21,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:21,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:21,095 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:21,095 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:21,096 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:21,097 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:21,097 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:21,097 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:21,097 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:21,097 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-10 15:29:21,097 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 26) no Hoare annotation was computed. [2020-07-10 15:29:21,098 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-10 15:29:21,098 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (<= 0 main_~m~0))) (or (and (<= main_~x~0 0) (<= main_~n~0 0) .cse0 .cse1) (and (<= (+ main_~m~0 1) main_~n~0) .cse0 .cse1))) [2020-07-10 15:29:21,098 INFO L268 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-07-10 15:29:21,098 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 20) no Hoare annotation was computed. [2020-07-10 15:29:21,102 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (<= 0 main_~m~0))) (or (and (<= main_~x~0 0) .cse0 (<= main_~m~0 0) .cse1) (and (<= (+ main_~m~0 1) main_~n~0) .cse0 .cse1))) [2020-07-10 15:29:21,103 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (<= 0 main_~m~0))) (or (and (<= main_~x~0 0) (<= main_~n~0 0) .cse0 .cse1) (and (<= (+ main_~m~0 1) main_~n~0) .cse0 .cse1))) [2020-07-10 15:29:21,103 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 26) no Hoare annotation was computed. [2020-07-10 15:29:21,103 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:21,103 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:21,103 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:21,104 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:21,104 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:21,104 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:21,110 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:21,110 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:21,112 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:21,112 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:21,112 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:21,112 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:21,112 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:21,114 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:21,115 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:21,115 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:21,115 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:21,115 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:21,115 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:21,115 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:21,116 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:21,116 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:21,116 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:21,116 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:21,116 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:29:21,116 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:21,117 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:21,117 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:21,117 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:21,117 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:21,117 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:21,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:21 BoogieIcfgContainer [2020-07-10 15:29:21,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:21,154 INFO L168 Benchmark]: Toolchain (without parser) took 5623.42 ms. Allocated memory was 144.7 MB in the beginning and 249.6 MB in the end (delta: 104.9 MB). Free memory was 101.3 MB in the beginning and 201.9 MB in the end (delta: -100.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:21,157 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:21,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.38 ms. Allocated memory is still 144.7 MB. Free memory was 101.1 MB in the beginning and 91.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:21,171 INFO L168 Benchmark]: Boogie Preprocessor took 140.72 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 91.2 MB in the beginning and 181.0 MB in the end (delta: -89.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:21,175 INFO L168 Benchmark]: RCFGBuilder took 485.54 ms. Allocated memory is still 202.4 MB. Free memory was 181.0 MB in the beginning and 164.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:21,176 INFO L168 Benchmark]: TraceAbstraction took 4663.12 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 163.5 MB in the beginning and 201.9 MB in the end (delta: -38.4 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:21,183 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.33 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.38 ms. Allocated memory is still 144.7 MB. Free memory was 101.1 MB in the beginning and 91.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.72 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 91.2 MB in the beginning and 181.0 MB in the end (delta: -89.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 485.54 ms. Allocated memory is still 202.4 MB. Free memory was 181.0 MB in the beginning and 164.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4663.12 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 163.5 MB in the beginning and 201.9 MB in the end (delta: -38.4 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((x <= 0 && 0 <= x) && m <= 0) && 0 <= m) || ((m + 1 <= n && 0 <= x) && 0 <= m) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 79 SDtfs, 48 SDslu, 260 SDs, 0 SdLazy, 128 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 23 NumberOfFragments, 83 HoareAnnotationTreeSize, 15 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 81 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 3648 SizeOfPredicates, 6 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 9/13 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...